相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
Federico Perea et al.
TOP (2020)
Facet separation with one linear program
Michele Conforti et al.
MATHEMATICAL PROGRAMMING (2019)
Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit
David Canca et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2019)
Benders decomposition for very large scale partial set covering and maximal covering location problems
Jean-Francois Cordeau et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
The Design of a Metro Network Using a Genetic Algorithm
Aleksander Krol et al.
APPLIED SCIENCES-BASEL (2019)
The Benders decomposition algorithm: A literature review
Ragheb Rahmaniani et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
David Canca et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
Markus Sinnl et al.
MATHEMATICAL PROGRAMMING COMPUTATION (2016)
Location of speed-up subnetworks
Marie Schmidt et al.
ANNALS OF OPERATIONS RESEARCH (2014)
GRASP algorithms for the robust railway network design problem
Bosco Garcia-Archilla et al.
JOURNAL OF HEURISTICS (2013)
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
Quentin Botton et al.
INFORMS JOURNAL ON COMPUTING (2013)
Exact approaches to the single-source network loading problem
Ivana Ljubic et al.
NETWORKS (2012)
A note on the selection of Benders' cuts
Matteo Fischetti et al.
MATHEMATICAL PROGRAMMING (2010)
Urban rapid transit network design: accelerated Benders decomposition
Angel G. Marin et al.
ANNALS OF OPERATIONS RESEARCH (2009)
An improved Benders decomposition applied to a multi-layer network design problem
B. Fortz et al.
OPERATIONS RESEARCH LETTERS (2009)
Benders, metric and cutset inequalities for multicommodity capacitated network design
Alysson M. Costa et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2009)
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Walid Ben-Ameur et al.
NETWORKS (2007)
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
E Balas et al.
MATHEMATICAL PROGRAMMING (2003)
Lift-and-project for mixed 0-1 programming: recent progress
E Balas et al.
DISCRETE APPLIED MATHEMATICS (2002)
分享论文
