Efficient group cuts for integer programs

DOI10.1007/BF01588242zbMath0415.90064OpenAlexW2096067757MaRDI QIDQ3205025

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Constructive Duality in Integer Programming
• A Simple Algorithm for Integer Programs Using Group Constraints
• A Convergent Duality Theory for Integer Programming
• Computational experience with a group theoretic integer programming algorithm

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