Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

No abstract is available for this paper.

• Publication year

  1992

• Venue

  SIAM Journal on Optimization

• Publication date

  1992-08-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1137/0802024
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimum-weight two-connected spanning networks

  1990cited by this paper
• Maximum matching and a polyhedron with 0,1-vertices

  1965cited by this paper

• Design of survivable networks with low connectivity requirements

  2024cites this paper
• Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints

  2024cites this paper
• Facetness of Partition Inequalities of the p−vertex Spanning Subtree Polytope of a Graph

  2023cites this paper
• Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut

  2023cites this paper
• On Fault-Tolerant Low-Diameter Clusters in Graphs

  2022cites this paper
• Parallelisation of hybrid metaheuristics for COP solving

  2018cites this paper
• Designing WAN Topologies Under Redundancy Constraints 14

  2018cites this paper
• A metaheuristic for security budget allocation in utility networks

  2017cites this paper
• A parallel hybrid optimization algorithm for some network design problems

  2017cites this paper
• Heuristics for the network design problem with connectivity requirements

  2015cites this paper
• Heuristics for the Design of Reliable Networks with k-Tree Topology

  2015cites this paper
• The Recoverable Robust Two-Level Network Design Problem

  2015cites this paper
• A Network Design Problem with Two-Edge Matching Failures

  2015cites this paper
• On exact solutions for the Minmax Regret Spanning Tree problem

  2014cites this paper
• Networks, uncertainty, applications and a crusade for optimality

  2014cites this paper
• A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems

  2014cites this paper
• Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

  2014cites this paper
• A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization

  2013cites this paper
• Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

  2013cites this paper
• Dual Integrality in Combinatorial Optimization

  2013cites this paper
• The Maximum Weight Connected Subgraph Problem

  2013cites this paper
• Capacitated Network Design - Multi-Commodity Flow Formulations, Cutting Planes, and Demand Uncertainty (Netzwerkdesign - Mehrgüterflussformulierungen, Schnittebenen und Bedarfsunsicherheit)

  2012cites this paper
• IBM Research Report Partition Inequalities : Separation , Extensions and Network Design

  2011cites this paper
• Exact algorithms for network design problems using graph orientations

  2011cites this paper
• Cuts over Extended Formulations by Flow Discretization

  2011cites this paper
• Partition Inequalities: Separation, Extensions and Network Design,

  2011cites this paper
• Orientation-based models for {0,1,2}-survivable network design: theory and practice

  2010cites this paper
• The k edge-disjoint 3-hop-constrained paths polytope

  2010cites this paper
• Graphs and Algorithms in Communication Networks on Seven League Boots

  2010cites this paper
• Benders decomposition for the hop-constrainted survivable network design problem

  2010cites this paper
• Connectivity Upgrade Models for Survivable Network Design

  2009cites this paper
• Von der FakultII { Mathematik und Naturwissenschaften der Technischen UniversitBerlin zur Erlangung des akademischen Grades

  2009cites this paper
• The box-TDI system associated with 2-edge connected spanning subgraphs

  2009cites this paper
• Optimal Design of Survivable Multi-layer Telecommunication Networks

  2009cites this paper
• A Survey on Network Survivability Models

  2008influential citation
• On the Polytope of the (1, 2)-Survivable Network Design Problem

  2008cites this paper
• Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios

  2008cites this paper
• Strong Formulations for 2-Node-Connected Steiner Network Problems

  2008cites this paper
• Facet Generating Techniques

  2008cites this paper
• On the Steiner 2-edge connected subgraph polytope

  2008cites this paper
• Telecommunications modeling, policy, and technology

  2008cites this paper
• Integrally indecomposable polytopes and the survivable network design problem

  2007cites this paper
• Routing and Capacity Optimization for IP Networks

  2007cites this paper
• Routing and Capacity Optimization for IP Networks

  2007cites this paper
• SURVIVABLE ENERGY MARKETS

  2006cites this paper
• Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

  2006cites this paper
• Polyhedral Approaches to the Design of Survivable Networks

  2006cites this paper
• Integer Minkowski Programs and the Design of Survivable Networks

  2006cites this paper
• AND THE DESIGN OF SURVIVABLE NETWORKS

  2006cites this paper
• Optimization Issues in Distribution Network Design

  2006cites this paper
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

  2005cites this paper
• Strong formulations for network design problems with connectivity requirements

  2005cites this paper
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

  2005cites this paper
• On survivable network polyhedra

  2005cites this paper
• Design of Survivable Networks: A survey

  2005influential citation
• Separation of partition inequalities with terminals

  2004influential citation
• The k-edge- connected subgraph problem I: Polytopes and critical extreme points

  2004cites this paper
• Connectivity–splitting models for survivable network design

  2004cites this paper
• Optimization of Internet Protocol network design and routing

  2004cites this paper
• Minimum survivable graphs with bounded distance increase

  2003cites this paper
• Polyhedral results for two-connected networks with bounded rings

  2002influential citation
• Separation of partition inequalities for the (1, 2)-survivable network design problem

  2002cites this paper
• Design of Survivable Networks with Connectivity Requirements

  2002cites this paper
• On the dominant of the Steiner 2-edge connected subgraph polytope

  2001cites this paper
• Hop Constrained Network Design Problem with Partial Survivability

  2001cites this paper
• Discrete Bilevel Optimization Problems

  2001cites this paper
• New modeling approaches for the design of local access transport area networks

  2000cites this paper
• Strong inequalities for capacitated survivable network design problems

  2000cites this paper
• Separation of Partition Inequalities

  2000cites this paper
• Design of Survivable Networks with Bounded Rings

  2000cites this paper
• Steiner k-Edge Connected Subgraph Polyhedra

  2000cites this paper
• On the Linear Relaxation of the 2-node Connected Subgraph Polytope

  1999cites this paper
• Design of Communication Networks with Survivability Constraints

  1999influential citation
• Survivable Network Design: The State of the Art

  1999cites this paper
• Critical extreme points of the 2-edge connected spanning subgraph polytope

  1999influential citation
• Survivable mobile phone network architectures: models and solution methods

  1998cites this paper
• Topics in Personal Communications

  1998cites this paper
• Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems

  1998cites this paper
• Capacity and Survivability Models for Telecommunication Networks

  1997cites this paper
• Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

  1997cites this paper
• On perfectly two-edge connected graphs

  1997cites this paper
• A Network Dimensioning Tool a Network Dimensioning Tool

  1996cites this paper
• A Network Dimensioning Tool

  1996cites this paper
• K-edge Connected Polyhedra on Series-parallel Graphs

  1996cites this paper
• An integrated system for designing minimum cost survivable telecommunications networks

  1996cites this paper
• Chapter 10 Design of survivable networks

  1995cites this paper
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements

  1995cites this paper
• A bootstrap heuristic for designing minimum cost survivable networks

  1995cites this paper
• On two-connected subgraph polytopes

  1995cites this paper
• Modelle und Methoden zur Konstruktion ausfallsicherer Netzwerke

  1995cites this paper
• Formulations and algorithms for network design problems with connectivity requirements

  1995cites this paper
• Two-edge connected spanning subgraphs and polyhedra

  1994cites this paper
• EditionA polyhedral approach to multicommoditysurvivable network

  1994influential citation
• A polyhedral approach to multicommodity survivable network design

  1994influential citation
• On minimum cost isolated failure immune networks

  1994cites this paper
• Handbook in Operations Research and Management Science Volume on \networks" Chapter on \design of Survivable Networks"

  1993cites this paper
• The design of survivable directed networks

  1993cites this paper
• Directed Steiner Problems with Connectivity Constraints

  1993cites this paper
• Handbook in Operations Research and Management Science Volume on \networks" Chapter on \design of Survivable Networks"

  1993cites this paper
• Handbook in Operations Research and Management Science Volume on \networks" Chapter on \design of Survivable Networks"

  1993cites this paper