Branch and cut methods for network optimization

Authors:
L. Caccetta;S. P. Hill
Affiliations:
School of Mathematics and Statistics, Curtin University of Technology GPO Box U1987, Perth, WA 6845, Western Australia;School of Mathematics and Statistics, Curtin University of Technology GPO Box U1987, Perth, WA 6845, Western Australia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2001

Citing 15
Cited 1

Clique tree inequalities and the symmetric travelling salesman problem

Mathematics of Operations Research
Solving mixed integer programming problems using automatic reformulation

Operations Research
Integer and combinatorial optimization

Integer and combinatorial optimization
A new class of cutting planes for the symmetric travelling salesman problem

Mathematical Programming: Series A and B
An efficient algorithm for the minimum capacity cut problem

Mathematical Programming: Series A and B
Facet identification for the symmetric traveling salesman polytope

Mathematical Programming: Series A and B
A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Small travelling salesman polytopes

Mathematics of Operations Research
Solution of large-scale symmetric travelling salesman problems

Mathematical Programming: Series A and B
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
Polyhedral study of the capacitated vehicle routing problem

Mathematical Programming: Series A and B
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

SIAM Journal on Discrete Mathematics
Branch and cut algorithms

Advances in linear and integer programming

An Application of Branch and Cut to Open Pit Mine Scheduling

Journal of Global Optimization

Quantified Score

Hi-index	0.98

Visualization

Abstract

Combinatorial optimization problems arising in network applications are usually computationally difficult. Typically, one needs to solve a large mixed integer linear programming problem. Over the past decade, the method of branch and cut has emerged as a powerful technique for solving such problems. In this paper, we focus on computationally difficult network optimization problems, highlighting the effectiveness of branch and cut methods.