Minimum cost capacity installation for multicommodity network flows

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
Solving Airline Crew Scheduling Problems by Branch-and-Cut Karla Hoffman, Manfred Padberg Management Science Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringConvex HullBranch And Cut	1993	535
Modeling and Solving the Two-Facility Capacitated Network Loading Problem Thomas L. Magnanti, Prakash Mirchandani, Rita Vachani Operations Research Mathematical ProgrammingEngineeringNetwork PlanningNetwork AnalysisDiscrete Optimization	1995	223
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
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut Karla Hoffman, Manfred Padberg INFORMS Journal on Computing Mathematical ProgrammingBranch-and-bound AlgorithmGeneral Zero-oneEngineeringGeneral Zero-one Problems	1991	148
Network Design Using Cut Inequalities Francisco Barahona SIAM Journal on Optimization Mathematical ProgrammingEngineeringNetwork PlanningNetwork RobustnessNetwork Analysis	1996	146
A polyhedral approach to multicommodity survivable network design Mechthild Stoer, Geir Dahl Numerische Mathematik Network ScienceGraph TheoryEngineeringSurvivable NetworkNetwork Planning	1994	126
On feasibility conditions of multicommodity flows in networks Kenji Onaga, Osamu Kakusho IEEE Transactions on Circuit Theory Mathematical ProgrammingEngineeringNetwork RobustnessNetwork AnalysisDual Condition	1971	126
Computational experience with a difficult mixedinteger multicommodity flow problem Daniel Bienstock, Oktay Günlük Mathematical Programming Mathematical ProgrammingEngineeringInteger OptimizationMixed Integer OptimizationComputational Experience	1995	90

Page 1