Virtual private network design over the first Chvátal closure

No abstract is available for this paper.

• Publication year

  2015

• Venue

  RAIRO Oper. Res.

• Publication date

  2015-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1051/ro/2014056
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the difficulty of virtual private network instances

  2014influential reference
• Robust network design

  2013cited by this paper
• From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

  2011cited by this paper
• A heuristic to generate rank-1 GMI cuts

  2010influential reference
• Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem

  2010cited by this paper
• MIR closures of polyhedral sets

  2009cited by this paper
• Optimizing over the split closure

  2008cited by this paper
• Projected Chvátal–Gomory cuts for mixed integer linear programs

  2008influential reference
• Combinatorial Optimization: Theory and Algorithms

  2007cited by this paper
• Provisioning virtual private networks under traffic uncertainty

  2007influential reference
• Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints

  2007influential reference
• Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study

  2007cited by this paper
• 0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets

  2006cited by this paper
• New Approaches for Virtual Private Network Design

  2005cited by this paper
• On cycles and the stable multi-set polytope

  2005cited by this paper
• Optimizing over the first Chvátal closure

  2005cited by this paper
• CHAPTER 8 – Fair Networks

  2004cited by this paper
• Routing, flow, and capacity design in communication and computer networks

  2004cited by this paper
• Embedding Cuts in a Branch & Cut Framework : a Computational Study with { 0 , 12 }-Cuts

  2003influential reference
• Stable multi-sets

  2002cited by this paper
• Matching: A Well-Solved Class of Integer Linear Programs

  2001cited by this paper
• Cisco Secure Virtual Private Networks

  2001cited by this paper
• What is a VPN?

  2001cited by this paper
• Provisioning a virtual private network: a network design problem for multicommodity flow

  2001cited by this paper
• A flexible model for resource management in virtual private networks

  1999cited by this paper
• What Is a VPN ? — Part I

  1998cited by this paper
• On the facial structure of set packing polyhedra

  1973cited by this paper
• Edmonds polytopes and a hierarchy of combinatorial problems

  1973influential reference
• An algorithm for integer solutions to linear programs

  1958cited by this paper

• Cost-Effective Survivable Controller Placement in Software-Defined Networks

  2021cites this paper
• The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut

  2018cites this paper
• Experiments on virtual private network design with concave capacity costs

  2018cites this paper