Aggregation of constraints in integer programming
From MaRDI portal
Publication:1108194
DOI10.1016/0377-2217(88)90032-XzbMath0653.90050OpenAlexW2065395199MaRDI QIDQ1108194
Mark H. Karwan, A. J. G. Babu, Balasubramanian Ram
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90032-x
Related Items
A result in surrogate duality for certain integer programming problems ⋮ How effective is aggregation for solving 0-1 models? ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models
Cites Work
- Unnamed Item
- Transformation of integer programs to knapsack problems
- Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- An Algorithm for Large Set Partitioning Problems
- Set Partitioning: A survey
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- An input system for linear programming problems *
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Optimal Political Districting by Implicit Enumeration Techniques
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
- A note on equivalent systems of linear diophantine equations
