Branch and cut methods for network optimization
From MaRDI portal
Publication:5936762
DOI10.1016/S0895-7177(00)00258-2zbMath0973.90083WikidataQ127613624 ScholiaQ127613624MaRDI QIDQ5936762
Stephen P. Hill, Louis Caccetta
Publication date: 8 July 2001
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral study of the capacitated vehicle routing problem
- Solution of large-scale symmetric travelling salesman problems
- Facet identification for the symmetric traveling salesman polytope
- An efficient algorithm for the minimum capacity cut problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- A new class of cutting planes for the symmetric travelling salesman problem
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- On the solution of traveling salesman problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- A new subtour elimination constraint for the vehicle routing problem
- A branch-and-cut algorithm for vehicle routing problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Gomory cuts revisited
- A branch and cut method for the degree-constrained minimum spanning tree problem
- The Truck Dispatching Problem
- Applications of Linear Programming in the Oil Industry
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Outline of an algorithm for integer solutions to linear programs
- Two exact algorithms for the distance-constrained vehicle routing problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The traveling salesman problem on a graph and some related integer polyhedra
- Optimal Routing under Capacity and Distance Restrictions
- Solving Large-Scale Zero-One Linear Programming Problems
- An exact algorithm for the asymmetrical capacitated vehicle routing problem
- Multi-Terminal Network Flows
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Topological design of centralized computer networks—formulations and algorithms
- Odd Minimum Cut-Sets and b-Matchings
- Small Travelling Salesman Polytopes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- TSPLIB—A Traveling Salesman Problem Library
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Fenchel Cutting Planes for Integer Programs
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Polyhedral techniques in combinatorial optimization I: Theory
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
- Solution of a Large-Scale Traveling-Salesman Problem
- Minimum partition of a matroid into independent subsets
- Edmonds polytopes and weakly hamiltonian graphs
