Efficient group cuts for integer programs

DOI10.1007/BF01588242MaRDI QIDQ3205025zbMATH OpenOpenAlexFDO

Authors David E. Bell

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01588242

zbMATH Keywords

integer programmingcolumn generationLagrangiangroup theoretic methodgeneralized linear programmingefficient group cutsGomory relaxation

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3573593 (Why is no real title available?)
• A Convergent Duality Theory for Integer Programming
• A Simple Algorithm for Integer Programs Using Group Constraints
• Computational experience with a group theoretic integer programming algorithm
• Constructive Duality in Integer Programming

Cited in

(1)

• A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

This page was built for publication: Efficient group cuts for integer programs

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