On the reduction method for integer linear programs. II

DOI10.1016/0166-218X(85)90028-9zbMath0607.90063MaRDI QIDQ1085786

A. A. Elimam, Salah E. Elmaghraby

Publication date: 1985

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

zbMATH Keywords

integer linear programsnon- negative discrete variablessequential reduction of linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items (6)

Sequential and simultaneous aggregation of diophantine equations ⋮ New results for aggregating integer-valued equations ⋮ A new reduction method in integer programming ⋮ The knapsack problem with generalized upper bounds ⋮ Sensitivity analysis for knapsack problems: A negative result ⋮ On aggregating two linear diophantine equations

Cites Work

• Unnamed Item
• Unnamed Item
• Transformation of integer programs to knapsack problems
• Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
• New results on equivalent integer programming formulations
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Aggregating diophantine equations
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

This page was built for publication: On the reduction method for integer linear programs. II