Network loading problem: valid inequalities from 5- and higher partitions

DOI10.1016/j.cor.2018.06.013zbMath1458.90162OpenAlexW2808795063WikidataQ129625129 ScholiaQ129625129MaRDI QIDQ1654355

Y. K. Agarwal

Publication date: 8 August 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.013

zbMATH Keywords

integer programmingbranch and boundvalid inequalities\(p\)-partitionnetwork loading

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items

Chvátal-Gomory cuts for the Steiner tree problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Solving survivable two-layer network design problems by metric inequalities
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• The convex hull of two core capacitated network design problems
• An improved Benders decomposition applied to a multi-layer network design problem
• Combinatorial approaches to multiflow problems
• On the spanning tree polyhedron
• Minimum cost capacity installation for multicommodity network flows
• A branch-and-cut algorithm for capacitated network design problems
• Separating tight metric inequalities by bilevel programming
• Metric inequalities and the network loading problem
• A partitioning algorithm for the network loading problem
• Polyhedral structure of the 4-node network design problem
• On cut-based inequalities for capacitated network design polyhedra
• Design of Capacitated Multicommodity Networks with Multiple Facilities
• Solving the two‐facility network design problem with 3‐partition facets
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Design of Survivable Networks Using Three- and Four-Partition Facets
• k-Partition-based facets of the network design problem
• Capacitated Network Design—Polyhedral Structure and Computation