Aggregating diophantine equations

DOI10.1007/BF01917186MaRDI QIDQ5656594zbMATH OpenOpenAlexFDO

Authors Fred Glover, R. E. D. Woolsey

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)

Cites work

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

Cited in

(19)

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

This page was built for publication: Aggregating diophantine equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656594)