Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems

DOI10.1287/opre.31.4.795zbMath0524.90066OpenAlexW2000709847MaRDI QIDQ3037134

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.4.795

zbMATH Keywords

implementation integer linear programs set partitioning computational evaluation comparison of algorithm constraint aggregation approaches

Mathematics Subject Classification ID

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

Related Items (7)

On the reduction method for integer linear programs. II ⋮ A new enumeration scheme for the knapsack problem ⋮ Aggregation of constraints in integer programming ⋮ On aggregating two linear diophantine equations ⋮ Optimal constraints aggregation method for ILP ⋮ 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 procedure for optimizing tactical response in oil spill clean up operations

This page was built for publication: Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems