Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
- 20 June 2015
- book chapter
- Published by Springer Nature
- p. 110-121
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Automatic Dantzig–Wolfe reformulation of mixed integer programsMathematical Programming, 2014
- Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack ProblemINFORMS Journal on Computing, 2013
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing ProblemOperations Research, 2012
- Cutting planes for branch‐and‐price algorithmsNetworks, 2011
- Branch‐Price‐and‐Cut Algorithms2011
- A heuristic to generate rank-1 GMI cutsMathematical Programming Computation, 2010
- Progress in computational mixed integer programming—A look back from the other side of the tipping pointAnnals of Operations Research, 2007
- A genetic algorithm for the generalised assignment problemComputers & Operations Research, 1997
- A set partitioning heuristic for the generalized assignment problemEuropean Journal of Operational Research, 1994
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990