A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 34-45
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Graph Partitioning and Graph Clustering2013
- Branch‐Price‐and‐Cut Algorithms2011
- SCIP: solving constraint integer programsMathematical Programming Computation, 2009
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover2006
- Packing cuts in undirected graphsNetworks, 2004
- Packing cycles in undirected graphsJournal of Algorithms, 2003
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- Edge-packing of graphs and network reliabilityDiscrete Mathematics, 1988
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971