咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 2 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 26 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 16 篇 管理学
    • 16 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 14 篇 理学
    • 14 篇 数学
  • 11 篇 工学
    • 8 篇 计算机科学与技术...
    • 2 篇 化学工程与技术
    • 1 篇 电气工程
    • 1 篇 交通运输工程
    • 1 篇 软件工程
  • 3 篇 经济学
    • 3 篇 应用经济学

主题

  • 26 篇 branch-and-cut a...
  • 6 篇 combinatorial op...
  • 5 篇 integer programm...
  • 3 篇 benders decompos...
  • 3 篇 polyhedral combi...
  • 2 篇 decomposition he...
  • 2 篇 conic integer pr...
  • 2 篇 angular constrai...
  • 2 篇 integer linear p...
  • 2 篇 mixed-integer no...
  • 1 篇 integer linear p...
  • 1 篇 traveling salesm...
  • 1 篇 separation
  • 1 篇 convex and bipar...
  • 1 篇 submodular funct...
  • 1 篇 2-connected grap...
  • 1 篇 supermodularity
  • 1 篇 stable set
  • 1 篇 gomory cuts
  • 1 篇 routing

机构

  • 3 篇 univ fed minas g...
  • 2 篇 mit dept chem en...
  • 2 篇 univ calif berke...
  • 1 篇 univ fed rio de ...
  • 1 篇 ecole hautes etu...
  • 1 篇 simon fraser uni...
  • 1 篇 ecole polytech m...
  • 1 篇 univ buenos aire...
  • 1 篇 essec business s...
  • 1 篇 indian inst tech...
  • 1 篇 univ bologna dei...
  • 1 篇 instituto de cie...
  • 1 篇 univ fed minas g...
  • 1 篇 univ lisbon fac ...
  • 1 篇 univ fed rio de ...
  • 1 篇 univ fed rio de ...
  • 1 篇 sandia natl labs...
  • 1 篇 univ padua dei v...
  • 1 篇 univ padua dei p...
  • 1 篇 programa de enge...

作者

  • 5 篇 da cunha alexand...
  • 5 篇 lucena abilio
  • 3 篇 atamtuerk alper
  • 2 篇 narayanan vishnu
  • 2 篇 fischetti m
  • 2 篇 pereira dilson l...
  • 2 篇 kesavan p
  • 2 篇 barton pi
  • 1 篇 simonetti luidi
  • 1 篇 toth p
  • 1 篇 marcelo bianchet...
  • 1 篇 maculan nelson
  • 1 篇 louveaux quentin
  • 1 篇 guo zhaomiao
  • 1 篇 toth paolo
  • 1 篇 fortz bernard
  • 1 篇 bianchetti marce...
  • 1 篇 monaci michele
  • 1 篇 audet c.
  • 1 篇 weismantel rober...

语言

  • 22 篇 英文
  • 4 篇 其他
检索条件"主题词=Branch-and-Cut algorithms"
26 条 记 录,以下是21-30 订阅
排序:
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem
收藏 引用
Procedia Computer Science 2021年 195卷 523-531页
作者: Marcelo Bianchetti Javier Marenco Departamento de Computación FCEyN Universidad de Buenos Aires Buenos Aires Argentina Instituto de Ciencias Universidad Nacional de General Sarmiento Buenos Aires Argentina
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in th... 详细信息
来源: 评论
Formulations for the Minimum 2-Connected Dominating Set Problem
收藏 引用
Electronic Notes in Discrete Mathematics 2013年 41卷 415-422页
作者: do Forte, Vinicius Leal Lucena, Abilio Maculan, Nelson Programa de Engenharia de Sistemas e Computação - COPPE Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil
Three formulations for the Minimum 2-Connected Dominating Set Problem, valid inequalities, a primal heuristic and branch-and-cut algorithms are introduced in this paper. As shown here, the preliminary computational re... 详细信息
来源: 评论
algorithms for Scheduling and Routing Problems
Algorithms for Scheduling and Routing Problems
收藏 引用
作者: Kamyar Khodamoradi Simon Fraser University
学位级别:博士
Optimization has been a central topic in most scientific disciplines for centuries. Continu- ous optimization has long benefited from well-established techniques of calculus. Discrete optimization, on the other hand, ... 详细信息
来源: 评论
Exact Solution algorithms for the Chordless Cycle Problem
收藏 引用
INFORMS JOURNAL ON COMPUTING 2022年 第4期34卷 1970-1986页
作者: Pereira, Dilson Lucas Lucena, Abilio da Cunha, Alexandre Salles Simonetti, Luidi Univ Fed Lavras Dept Comp Aplicada Caixa 3037 BR-37200900 Caixa Brazil Univ Fed Rio de Janeiro Programa Engn Sistemas & Comp Caixa 68511 BR-21941972 Rio De Janeiro Brazil Univ Fed Minas Gerais Dept Ciencia Comp BR-31270901 Belo Horizonte MG Brazil
A formulation, a heuristic, and branch-and-cut algorithms are investigated for the chordless cycle problem. This is the problem of finding a largest simple cycle for a given graph so that no edge between nonimmediatel... 详细信息
来源: 评论
Modeling and solving the angular constrained minimum spanning tree problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2019年 112卷 104775-000页
作者: da Cunha, Alexandre Salles Lucena, Abilio Univ Fed Minas Gerais Dept Ciencia Comp Belo Horizonte MG Brazil Univ Fed Rio de Janeiro Programa Engn Sistemas & Comp Rio De Janeiro Brazil
Assume one is given an angle alpha is an element of(0, 2 pi] and a complete undirected graph G = (V, E). The vertices in V represent points in the Euclidean plane. The edges in E represent the line segments between th... 详细信息
来源: 评论
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison
收藏 引用
EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2012年 第1-2期1卷 113-133页
作者: Roberti, Roberto Toth, Paolo Univ Bologna DEIS Viale Risorgimento 2 I-40136 Bologna BO Italy
This paper surveys the most effective mathematical models and exact algorithms proposed for finding the optimal solution of the well-known Asymmetric Traveling Salesman Problem (ATSP). The fundamental Integer Linear P... 详细信息
来源: 评论