A branch-and-cut algorithm for capacitated network design problems

References

Page 1

	Year	Citations
Integer and Combinatorial Optimization H. P. Williams, George L. Nemhauser, Laurence A. Wolsey Journal of the Operational Research Society	1990	5.5K
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems Manfred Padberg, Giovanni Rinaldi SIAM Review Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringBranch-and-cut AlgorithmComputational Complexity	1991	1.1K
Edge-Disjoint Spanning Trees of Finite Graphs C. St. J. A. Nash‐Williams Journal of the London Mathematical Society Graph MinorGraph TheoryStructural Graph TheoryTopological Graph TheoryNetwork Analysis	1961	793
On the Problem of Decomposing a Graph into <i>n</i> Connected Factors W. T. Tutte Journal of the London Mathematical Society Directed GraphNetwork ScienceGraph TheoryStructural Graph TheoryTopological Graph Theory	1961	659
A Computational Study of Search Strategies for Mixed Integer Programming Jeff Linderoth, Martin Savelsbergh INFORMS journal on computing Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringComputational ComplexityDiscrete Optimization	1999	360
Optimal attack and reinforcement of a network William H. Cunningham Journal of the ACM Network Theory (Electrical Engineering)EngineeringGame TheoryNetwork RobustnessNetwork Analysis	1985	254
Capacitated Network Design—Polyhedral Structure and Computation Daniel Bienstock, Oktay Günlük INFORMS journal on computing Mathematical ProgrammingRoute TrafficBranch-and-bound AlgorithmEngineeringNetwork Planning	1996	203
Minimum cost capacity installation for multicommodity network flows Daniel Bienstock, Sunil Chopra, Oktay Günlük, Mathematical Programming Network FlowsNetwork ScienceEngineeringDynamic Resource AllocationNetwork Planning	1998	176
The convex hull of two core capacitated network design problems Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani Mathematical Programming Mathematical ProgrammingNetwork ScienceGraph TheoryEngineeringNetwork Algorithm	1993	150
Network Design Using Cut Inequalities Francisco Barahona SIAM Journal on Optimization Mathematical ProgrammingEngineeringNetwork PlanningNetwork RobustnessNetwork Analysis	1996	146

Page 1