Solving the two‐facility network design problem with 3‐partition facets

DOI10.1002/net.21602zbMath1390.90164OpenAlexW2056958455MaRDI QIDQ4642448

Y. K. Agarwal, Faiz Hamid

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingtelecommunicationspolaritypolyhedral theoryfacet-inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (4)

Network loading problem: valid inequalities from 5- and higher partitions ⋮ A note on capacity models for network design ⋮ Train stop scheduling problem: an exact approach using valid inequalities and polar duality ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality

This page was built for publication: Solving the two‐facility network design problem with 3‐partition facets