Network design arc set with variable upper bounds

DOI10.1002/NET.20162MaRDI QIDQ3593365zbMATH OpenOpenAlexFDO

Authors Alper Atamtürk, Oktay Günlük

Publication date 20 July 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20162

zbMATH Keywords

cutting planesnetwork designpolyhedral structuremixed-integer roundingstrong valid inequalitiesfamilies of strong valid inequalitiesflow covers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Stochastic network models in operations research (90B15)

Recommendations

• Valid inequalities for the single arc design problem with set-ups
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• A Polyhedral Study of Integer Variable Upper Bounds
• scientific article; zbMATH DE number 1342120
• On capacitated network design cut-set polyhedra

Cited in

(11)

• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
• Unsplittable non-additive capacitated network design using set functions polyhedra
• 0-1 reformulations of the multicommodity capacitated network design problem
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• A note on capacity models for network design
• Further contributions to network optimization
• Lifted polymatroid inequalities for mean-risk optimization with indicator variables
• The splittable flow arc set with capacity and minimum load constraints
• Valid inequalities for the single arc design problem with set-ups
• Lifting for mixed integer programs with variable upper bounds
• The continuous knapsack set

This page was built for publication: Network design arc set with variable upper bounds

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