咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
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, ... 详细信息
来源: 评论
Supermodular covering knapsack polytope
收藏 引用
DISCRETE OPTIMIZATION 2015年 18卷 74-86页
作者: Atamtuerk, Alper Bhardwaj, Avinash Univ Calif Berkeley Ind Engn & Operat Res Berkeley CA 94720 USA
The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilist... 详细信息
来源: 评论
On the hop-constrained survivable network design problem with reliable edges
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 第Dec.期64卷 159-167页
作者: Botton, Quentin Fortz, Bernard Gouveia, Luis Catholic Univ Louvain Louvain Sch Management Louvain Belgium Univ Libre Bruxelles Fac Sci Dept Informat Brussels Belgium Univ Lisbon Fac Ciencias DEIO CIO Lisbon Portugal
In this paper, we study the hop-constrained survivable network design problem with reliable edges. Given a graph with non-negative edge costs and node pairs Q the hop-constrained survivable network design problem cons... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Conic mixed-integer rounding cuts
收藏 引用
MATHEMATICAL PROGRAMMING 2010年 第1期122卷 1-20页
作者: Atamtuerk, Alper Narayanan, Vishnu Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA
A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here w... 详细信息
来源: 评论
The submodular knapsack polytope
收藏 引用
DISCRETE OPTIMIZATION 2009年 第4期6卷 333-344页
作者: Atamtuerk, Alper Narayanan, Vishnu Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Indian Inst Technol Mumbai 400076 Maharashtra India
The submodular knapsack set is the discrete lower level set of a submodular function. The modular case reduces to the classical linear 0-1 knapsack set. One motivation for studying the submodular knapsack polytope is ... 详细信息
来源: 评论
A new formulation for the Traveling Deliveryman Problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第17期156卷 3223-3237页
作者: Mendez-Diaz, Isabel Zabala, Paula Lucena, Abilio Univ Buenos Aires FCEyN Depto Computac RA-1053 Buenos Aires DF Argentina Univ Fed Rio de Janeiro Depto Adm BR-21941 Rio De Janeiro Brazil
The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian Path Problem where the starting vertex of the path, i.e. a depot vertex, is fixed in advance and the cost associated with a Hamilto... 详细信息
来源: 评论
Intermediate integer programming representations using value disjunctions
收藏 引用
DISCRETE OPTIMIZATION 2008年 第2期5卷 293-313页
作者: Koeppe, Matthias Louveaux, Quentin Weismantel, Robert Otto VonGuericke Univ Magdeburg Dept Math IMO D-39106 Magdeburg Germany
We introduce a general technique for creating an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended form... 详细信息
来源: 评论
New branch-and-cut algorithm for bilevel linear programming
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2007年 第2期134卷 353-370页
作者: Audet, C. Savard, G. Zghal, W. Ecole Hautes Etud Commerciales Gerad Montreal PQ Canada Ecole Polytech Montreal PQ H3C 3A7 Canada
Linear mixed 0-1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0-1 Gomory cuts to ... 详细信息
来源: 评论