Sequential and simultaneous aggregation of diophantine equations
From MaRDI portal
For any system of linear diophantine equations there exists other such equations each of which has the same set of nonnegative integer solutions as the given system. New procedures for sequential and simultaneous aggregation are presented improving known results, e.g. providing equivalent equations with smaller coefficients.
Recommendations
Cites work
- A new reduction method in integer programming
- Aggregating diophantine equations
- Aggregation of a class of systems of integer-valued equations
- Aggregation of linear integer equations
- Aggregation of nonnegative integer-valued equations
- An input system for linear programming problems *
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- scientific article; zbMATH DE number 3559280 (Why is no real title available?)
- scientific article; zbMATH DE number 3572261 (Why is no real title available?)
- New results on equivalent integer programming formulations
- On the reduction method for integer linear programs. II
- Transformation of integer programs to knapsack problems
Cited in
(8)- Sensitivity analysis for knapsack problems: A negative result
- On aggregating two linear diophantine equations
- Disaggregation of Diophantine equation with Boolean variables
- New results for aggregating integer-valued equations
- Reducing an integer linear equation to an equivalent system
- scientific article; zbMATH DE number 3912106 (Why is no real title available?)
- Sequential and simultaneous aggregation of diophantine equations
- Aggregation of nonnegative integer-valued equations
This page was built for publication: Sequential and simultaneous aggregation of diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327205)