A branch-and-price algorithm for capacitated hypergraph vertex separation
- 9 September 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (1) , 39-68
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Automatic Dantzig–Wolfe reformulation of mixed integer programsMathematical Programming, 2014
- Parametric power supply networksJournal of Combinatorial Optimization, 2013
- Dual-Optimal Inequalities for Stabilized Column GenerationOperations Research, 2006
- The vertex separator problem: a polyhedral investigationMathematical Programming, 2005
- Permuting Sparse Rectangular Matrices into Block-Diagonal FormSIAM Journal on Scientific Computing, 2004
- The next release problemInformation and Software Technology, 2001
- Plant location with minimum inventoryMathematical Programming, 1998
- Decomposing Matrices into BlocksSIAM Journal on Optimization, 1998
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981