Technical Note—Solving Integer Programming Problems by Aggregating Constraints
From MaRDI portal
Publication:4162970
DOI10.1287/opre.25.2.346zbMath0383.90081OpenAlexW2069981095MaRDI QIDQ4162970
Kenneth E. Kendall, Stanley Zionts
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.2.346
Related Items
On the reduction method for integer linear programs. II ⋮ Aggregation of constraints in integer programming ⋮ A result in surrogate duality for certain integer programming problems ⋮ On aggregating two linear diophantine equations ⋮ Optimal constraints aggregation method for ILP ⋮ New results on equivalent integer programming formulations ⋮ A discrete variant of Farkas' lemma ⋮ How effective is aggregation for solving 0-1 models? ⋮ A solution method for a knapsack problem and its variant ⋮ Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming ⋮ A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme ⋮ A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
