A polyhedral approach for solving two facility network design problem

DOI10.1007/978-3-642-21527-8_12MaRDI QIDQ3091487zbMATH OpenOpenAlexFDO

Authors Faiz Hamid, Y. K. Agarwal

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_12

Mathematics Subject Classification ID

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

Recommendations

• Solving the two‐facility network design problem with 3‐partition facets
• k-Partition-based facets of the network design problem
• Design of survivable networks using three- and four-partition facets
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• scientific article; zbMATH DE number 2196281

Cited in

(7)

• Fixed charge multicommodity network design using p-partition facets
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• Polyhedral structure of the 4-node network design problem
• Solving the two‐facility network design problem with 3‐partition facets
• Algorithms and extended formulations for one and two facility network design
• k-Partition-based facets of the network design problem
• The convex hull of two core capacitated network design problems

This page was built for publication: A polyhedral approach for solving two facility network design problem

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