Stronger Gomory cuts by multidimensional knapsack problems

DOI10.1080/02331938008842651MaRDI QIDQ3922476zbMATH OpenOpenAlexFDO

Authors J. A. van der Velde, Rob Kaas, G. de Leve

Publication date 1980

Published in Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938008842651

zbMATH Keywords

computation of lower boundscomputational experiencesmultidimensional knapsack problemspure integer linear programmingspecially structured problemstronger Gomory cutssurrogate constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

This page was built for publication: Stronger Gomory cuts by multidimensional knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922476)