Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- 17 January 2007
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 4 (1) , 87-102
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problemComputers & Operations Research, 2006
- Finding optimal realignments in sports leagues using a branch-and-cut-and-price approachInternational Journal of Operational Research, 2005
- A Lagrangian relaxation approach to the edge-weighted clique problemEuropean Journal of Operational Research, 2001
- Exact Solution of the Quadratic Knapsack ProblemINFORMS Journal on Computing, 1999
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- Linear programming for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 1996
- The partition problemMathematical Programming, 1993
- Facets of the clique partitioning polytopeMathematical Programming, 1990
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963