Optimal constraints aggregation method for ILP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- A method for reducing coefficients in integer linear inequalities
- Aggregating diophantine equations
- Aggregation of equations in integer programming
- Coefficient reduction for inequalities in 0–1 variables
- Gaussian random projections for Euclidean membership problems
- Generatingfunctionology
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- New results for aggregating integer-valued equations
- Polynomial-Time Aggregation of Integer Programming Problems
- Small solutions of linear diophantine equations
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- 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
(7)- Solving the patient admission scheduling problem using constraint aggregation
- Extension of the Top-Down Data-Driven Strategy to ILP
- A note on aggregating constraints in integer programming
- Aggregating assignment constraints
- How effective is aggregation for solving 0-1 models?
- On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes
- Aggregation of constraints in integer programming
This page was built for publication: Optimal constraints aggregation method for ILP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2416430)