scientific article; zbMATH DE number 1342120

MaRDI QIDQ4263702zbMATH OpenFDO

Authors Alper Atamtürk, G. L. Nemhauser, Martin W. P. Savelsbergh

Publication date 21 November 1999

zbMATH Keywords

linear programming relaxationnetwork flow problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Linear programming (90C05)

Recommendations

• Valid inequalities for problems with additive variable upper bounds
• scientific article; zbMATH DE number 409489
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Valid inequalities based on simple mixed-integer sets
• Integer Programming and Combinatorial Optimization
• Valid inequalities for mixed integer linear programs
• Additive s-functional inequalities
• Additive-Quadratic Functional Inequalities
• Additive \(\rho \)-functional inequalities and equations
• Inequalities for approximately additive mappings

Cited in

(5)

• Separation, dimension, and facet algorithms for node flow polyhedra
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Network design arc set with variable upper bounds
• A Polyhedral Study of Integer Variable Upper Bounds
• Valid inequalities for problems with additive variable upper bounds

This page was built for publication:

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