Aggregating diophantine equations

DOI10.1007/BF01917186zbMath0244.90030OpenAlexW2032371820MaRDI QIDQ5656594

R. E. D. Woolsey, Fred Glover

Publication date: 1972

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01917186

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Sequential and simultaneous aggregation of diophantine equations, On the reduction method for integer linear programs. II, Using aggregation to optimize long-term production planning at an underground mine, New results for aggregating integer-valued equations, Aggregation of constraints in integer programming, A result in surrogate duality for certain integer programming problems, On aggregating two linear diophantine equations, Optimal constraints aggregation method for ILP, Equivalent constraints for discrete sets, Coefficient reduction for inequalities in 0–1 variables, New results on equivalent integer programming formulations, On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, Zero duality gap in surrogate constraint optimization: a concise review of models, Aggregation of equations in integer programming, Reducing an integer linear equation to an equivalent system, On the complexity of surrogate and group relaxation for integer linear programs, Decomposing 1-Sperner hypergraphs, Aggregation of nonnegative integer-valued equations, On the Containment Problem for Linear Sets

Cites Work

• Transformation of integer programs to knapsack problems
• Integer Programming over a Finite Additive Group