Branch and cut methods for network optimization

Mathematical and Computer Modelling

Volumn 33, Issue 4-5, 2001, Pages 517-532

  Caccetta, L ^a   Hill, S P ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

Branch and cut; Combinatorial optimization; Cutting planes; Mixed integer linear programming

Indexed keywords

EID: 0035142134     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(00)00258-2     Document Type: Article

References (63)

1. Polyhedral techniques in combinatorial optimization I: Theory
2. Branch-and-cut algorithms
3. Branch and cut algorithms
4. Branch and bound methods
5. A branch and cut algorithm for the resolution of large scale travelling salesman problems
6. Solution of a large scale travelling salesman problem
7. Solution of large-scale symmetric travelling salesman problems
8. Maximum matching and a polyhedron with 0,1 vertices
9. Edmonds polytopes and weakly Hamiltonian graphs
10. Polyhedral theory
11. Clique tree inequalities and the symmetric travelling salesman problem
12. The travelling salesman problem on a graph and some related integer polyhedra
13. A new class of cutting planes for the symmetric travelling salesman problem
14. Small travelling salesman polytopes
15. Multi-terminal network flows
16. An efficient algorithm for the minimum capacity cut problem
17. Odd minimum cut sets and b-matchings
18. On the symmetric travelling salesman problem: Solution of a 120-city problem
19. Solving large-scale symmetric travelling salesman problems to optimality
20. Facet identification for the symmetric travelling salesman polytope
21. A travelling salesman problem library
22. Applications of linear programming in the oil industry
23. The truck despatching problem
24. Two exact algorithms for the distance constrained vehicle routing problem
25. An exact algorithm for the asymmetrical capacitated vehicle routing problem
26. A branch and bound algorithm for a class of asymmetrical vehicle routing problems
27. A cutting plane algorithm for the m-salesman problem
28. Comb inequalities for the vehicle routing problem
29. Optimal routing under capacity and distance restrictions
30. The vehicle routing problem: An overview of exact and approximate algorithms
31. The capacitated vehicle routing problem: Some new cutting planes
32. A new subtour elimination constraint for the vehicle routing problem
33. Polyhedral study of the capacitied vehicle routing problem
34. Optimal solution of vehicle routing problems using minimum K-trees
35. A branch-and-cut algorithm for vehicle routing problems
36. Graph theory in network design and analysis
37. Degree-constrained minimum spanning tree
38. Topological designs of centralized computer networks - Formulation and algorithms
39. Edge exchange in the degree-constrained minimum spanning tree problem
40. A Lagrangian approach to the degree-constrained minimum spanning tree problem
41. Outline of an algorithm for integer solutions to linear programs
42. Solving linear programming problems in integers
43. An algorithm for integer solutions to linear programs
44. Gomory cuts revisited
45. Mixed 0-1 programming by list-and-project in a branch-and-cut framework
46. Solving large-scale zero one linear programming problems
47. Solving mixed integer programming problems using automatic reformation
48. Fenchel cutting planes for integer programs
49. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
50. Cones of matrices and set-functions of 0-1 optimization
51. A lift-and-project cutting plane algorithm for mixed 0-1 programs
52. On the complexity of a cutting plane algorithm for solving combinatorial linear programs