Virtual private network design over the first Chvátal closure

DOI10.1051/RO/2014056MaRDI QIDQ5501875zbMATH OpenOpenAlexFDO

Authors Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi

Publication date 14 August 2015

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2014056

zbMATH Keywords

binary formulationChvátal-Gomory closurecomputational analysiscutting planesVPN design problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the difficulty of virtual private network instances
• Virtual private network design
• Experiments on virtual private network design with concave capacity costs
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
• Provisioning virtual private networks under traffic uncertainty

Cites work

• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A heuristic to generate rank-1 GMI cuts
• Approximability of robust network design
• Combinatorial optimization. Theory and algorithms.
• Edmonds polytopes and a hierarchy of combinatorial problems
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• MIR closures of polyhedral sets
• New Approaches for Virtual Private Network Design
• On cycles and the stable multi-set polytope
• On the difficulty of virtual private network instances
• On the facial structure of set packing polyhedra
• Optimizing over the first Chvátal closure
• Optimizing over the split closure
• Outline of an algorithm for integer solutions to linear programs
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Provisioning virtual private networks under traffic uncertainty
• Stable multi-sets

Cited in

(3)

• The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut
• On the difficulty of virtual private network instances
• Experiments on virtual private network design with concave capacity costs

This page was built for publication: Virtual private network design over the first Chvátal closure

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