On aggregating two linear diophantine equations

DOI10.1016/S0166-218X(97)00123-6zbMath0897.11007OpenAlexW2070981113MaRDI QIDQ1383381

Nan Zhu, Kevin A. Broughan

Publication date: 24 May 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

aggregationlinear diophantine equationsequivalence of systems

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Linear Diophantine equations (11D04)

Cites Work

• Aggregation of nonnegative integer-valued equations
• On equivalent knapsack problems
• On the reduction method for integer linear programs. II
• A new reduction method in integer programming
• Sequential and simultaneous aggregation of diophantine equations
• New results for aggregating integer-valued equations
• Transformation of integer programs to knapsack problems
• Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
• A note on aggregating constraints in integer programming
• New results on equivalent integer programming formulations
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
• A note on equivalent systems of linear diophantine equations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On aggregating two linear diophantine equations