Aggregation of constraints in integer programming
From MaRDI portal
Constraint aggregation provides a method of formulating equivalent integer programs with a smaller number of constraints. This approach was widely researched in the seventies but its use was discounted due to large coefficients in the equivalent problem. We provide a method that yields numerically smaller constraint coefficients. This method has enabled us to investigate other computational issues relating to the use of constraint aggregation in solving integer programming problems, more thoroughly than has previously been possible.
Recommendations
Cites work
- A note on equivalent systems of linear diophantine equations
- Aggregating diophantine equations
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for Large Set Partitioning Problems
- An input system for linear programming problems *
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Optimal Political Districting by Implicit Enumeration Techniques
- Set Partitioning: A survey
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- Transformation of integer programs to knapsack problems
Cited in
(17)- A result in surrogate duality for certain integer programming problems
- Identification of unidentified equality constraints for integer programming problems
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Optimal constraints aggregation method for ILP
- Iterative variable aggregation and disaggregation in IP: an application
- An aggregate function method for integer programming
- scientific article; zbMATH DE number 3912106 (Why is no real title available?)
- A note on aggregating constraints in integer programming
- scientific article; zbMATH DE number 3950203 (Why is no real title available?)
- Aggregating assignment constraints
- scientific article; zbMATH DE number 4074812 (Why is no real title available?)
- scientific article; zbMATH DE number 4087417 (Why is no real title available?)
- Aggregation of Resource Constraints for Groups of Similar Components in Manufacturing Systems
- How effective is aggregation for solving 0-1 models?
- Aggregation and Disaggregation in Integer Programming Problems
- Solving the patient admission scheduling problem using constraint aggregation
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
This page was built for publication: Aggregation of constraints in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108194)
