Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

No abstract is available for this paper.

• Publication year

  2013

• Venue

  INFORMS journal on computing

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/ijoc.1110.0472
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Using a Hop-Constrained Model to Generate Alternative Communication Network Design

  2015influential reference
• Risk-sharing networks and farsighted stability

  2014cited by this paper
• Attitudes Towards Income Risk in the Presence of Quantity Constraints

  2013cited by this paper
• Integer and Combinatorial Optimization

  2013cited by this paper
• Social long-term care insurance and redistribution

  2013cited by this paper
• The economics of airport noise: how to manage markets for noise licenses

  2012cited by this paper
• The natalist bias of pollution control

  2012cited by this paper
• Exact approaches to the single‐source network loading problem

  2012cited by this paper
• Introduction to Stochastic programming (2nd edition), Springer verlag, New York

  2011cited by this paper
• Nested potentials and robust equilibria

  2011cited by this paper
• Sufficient and necessary conditions for perpetual multi-assets exchange options

  2011cited by this paper
• Myopic or Farsighted? An Experiment on Network Formation

  2011cited by this paper
• Hierarchical shrinkage in time-varying parameter models

  2011cited by this paper
• Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization

  2011cited by this paper
• Monopolistic competition in general equilibrium: Beyond the CES

  2011cited by this paper
• Hierarchical shrinkage priors for dynamic regressions with many predictors

  2011cited by this paper
• A Theory of Fairness and Social Welfare

  2011cited by this paper
• Série Scientifique Scientific Series 2011 s-13 A Comparison of Forecasting Procedures For Macroeconomic Series : The Contribution of Structural Break Models

  2011cited by this paper
• Effects of the Uncertainty about Global Economic Recovery on Energy Transition and CO2 Price

  2011cited by this paper
• The Economics of Clusters: Lessons from the French Experience

  2011cited by this paper
• Wiley‐Interscience Series in Discrete Mathematics and Optimization

  2011cited by this paper
• Sustainable growth and modernization under environmental hazard and adaptation

  2011cited by this paper
• SNDlib 1.0—Survivable Network Design Library

  2010cited by this paper
• A note on the selection of Benders’ cuts

  2010cited by this paper
• The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs

  2010cited by this paper
• School autonomy and educational performance: within-country evidence

  2010cited by this paper
• Dynamic joint investments in supply chains under information asymmetry

  2010cited by this paper
• Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems

  2010cited by this paper
• Fair allocation of indivisible goods among two agents

  2010cited by this paper
• The MCF-Separator – Detecting and Exploiting Multi-Commodity Flows in MIPs

  2010cited by this paper
• Industrial Organization: Markets and Strategies

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

  2010cited by this paper
• Accelerating Benders Decomposition by Local Branching

  2009cited by this paper
• An improved Benders decomposition applied to a multi-layer network design problem

  2009cited by this paper
• SCIP: solving constraint integer programs

  2009cited by this paper
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem

  2009cited by this paper
• Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

  2008cited by this paper
• SNDlib 1.0 - survivable network design library

  2007cited by this paper
• Integer programming formulations for the two 4‐hop‐constrained paths problem

  2007influential reference
• The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut

  2007cited by this paper
• Design of survivable networks

  2006cited by this paper
• On the k edge-disjoint 2-hop-constrained paths polytope

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

  2006cited by this paper
• Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS

  2006cited by this paper
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

  2006cited by this paper
• Strong formulations for network design problems with connectivity requirements

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

  2005influential reference
• A survey on benders decomposition applied to fixed-charge network design problems

  2005influential reference
• Telecommunications Planning: Innovations in Pricing, Network Design and Management (Operations Research/Computer Science Interfaces Series)

  2005cited by this paper
• Partitioning procedures for solving mixed-variables programming problems

  2005cited by this paper
• A note on hop-constrained walk polytopes

  2004cited by this paper
• The 2‐path network problem

  2004cited by this paper
• On the directed hop-constrained shortest path problem

  2004cited by this paper
• Two-Connected Networks with Rings of Bounded Cardinality

  2004cited by this paper
• An approximation algorithm for Stackelberg network pricing

  2004cited by this paper
• New formulations and solution procedures for the hop constrained network design problem

  2003cited by this paper
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

  2003cited by this paper
• MPLS over WDM network design with packet level QoS constraints based on ILP models

  2003cited by this paper
• Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

  2002cited by this paper
• Polyhedral results for two-connected networks with bounded rings

  2002cited by this paper
• Benchmarking optimization software with performance profiles

  2001cited by this paper
• Economics of Cities

  2000cited by this paper
• Transmission Network Planning Under Uncertainty with Benders Decomposition

  2000cited by this paper
• Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction

  2000cited by this paper
• Design of Survivable Networks with Bounded Rings

  2000cited by this paper
• Exact solution of multicommodity network optimization problems with general step cost functions

  1999cited by this paper
• Notes on polyhedra associated with hop-constrained paths

  1999influential reference
• L-shaped decomposition of two-stage stochastic programs with integer recourse

  1998cited by this paper
• A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

  1998cited by this paper
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

  1998influential reference
• Multicommodity flow models for spanning trees with hop constraints

  1996influential reference
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

  1992cited by this paper
• A personal communication

  1989cited by this paper
• The design of centralized networks with reliability and availability constraints

  1988cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• The complexity of finding maximum disjoint paths with length constraints

  1982cited by this paper
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

  1981cited by this paper

• A Benders decomposition-based reoptimization method to find the best-${\boldsymbol{{K}}}$K fixed-charge network designs

  2026cites this paper
• LP Relaxations for Routing and Wavelength Assignment with Partial Path Protection: Formulations and Computations

  2025cites this paper
• Set System Approximation for Binary Integer Programs: Reformulations and Applications

  2025cites this paper
• On λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-cent-dians and generalized-center for net

  2025cites this paper
• A computational study on Integer Programming formulations for Hop-constrained survivable network design

  2025cites this paper
• Dynamic hub capacity planning in hyperconnected relay transportation networks under uncertainty

  2025cites this paper
• Benders decomposition for the large-scale probabilistic set covering problem

  2025cites this paper
• A novel Pareto-optimal cut selection strategy for Benders Decomposition

  2025cites this paper
• Complex network topology design on technology collaboration: small-world characteristics for intelligent manufacturing

  2025cites this paper
• On λ-Cent-Dians and Generalized-Center for Network Design

  2024cites this paper
• Optimization algorithms for the k edge-connected L-hop-constrained network design problem

  2024cites this paper
• Layout Optimization for a Large-Scale Grid-Connected Solar Power Plant

  2024cites this paper
• An ellipse-based locating method for flexible deployment of emergency UAVs

  2024cites this paper
• Your Mega-Constellations Can Be Slim: A Cost-Effective Approach for Constructing Survivable and Performant LEO Satellite Networks

  2024cites this paper
• An exact algorithm for multiple-equipment integrated scheduling in an automated container terminal using a double-cycling strategy

  2024cites this paper
• Network design with vulnerability constraints and probabilistic edge reliability

  2024cites this paper
• Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing

  2024cites this paper
• A heuristic-based benders decomposition for the hybrid relief distribution network minimizing deprivation cost of vulnerable areas

  2024cites this paper
• Multi-period stochastic programming for relief delivery considering evolving transportation network and temporary facility relocation/closure

  2023cites this paper
• Multi-period distribution networks with purchase commitment contracts

  2023cites this paper
• Robust capacitated Steiner trees and networks with uniform demands

  2023cites this paper
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems

  2023cites this paper
• The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm

  2023cites this paper
• Trade-offs among degree, diameter, and number of paths

  2023cites this paper
• An asynchronous parallel benders decomposition method for stochastic network design problems

  2023cites this paper
• Design of survivable wireless backhaul networks with reliability considerations

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

  2022cites this paper
• Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties

  2022cites this paper
• Reliability Analysis of Survivable Networks under the Hostile Model

  2022cites this paper
• The Star Degree Centrality Problem: A Decomposition Approach

  2021cites this paper
• On single-source capacitated facility location with cost and fairness objectives

  2021cites this paper
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints

  2021cites this paper
• Topology-Constrained Network Design

  2021cites this paper
• Multi-period sales districting problem

  2021cites this paper
• Network Design with Service Requirements: Scaling-up the Size of Solvable Problems

  2021cites this paper
• Hop-Constrained Metric Embeddings and their Applications

  2021cites this paper
• Efficient methods for the distance-based critical node detection problem in complex networks

  2021cites this paper
• The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach

  2021cites this paper
• Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem

  2021cites this paper
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework

  2021cites this paper
• Efficiency, access, and the mixed delivery of health care services

  2021cites this paper
• Benders decomposition for network design covering problems

  2020influential citation
• In search of network resilience: An optimization‐based view

  2020cites this paper
• On the number of edges in a graph with many two-hop disjoint paths

  2020cites this paper
• Wind farm cable layout optimization with constraints of load flow and robustness

  2020cites this paper
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints

  2020cites this paper
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation

  2020cites this paper
• Tree embeddings for hop-constrained network design

  2020cites this paper
• Layered graph approaches for combinatorial optimization problems

  2019cites this paper
• Distance Transformation for Network Design Problems

  2019cites this paper
• Design of robust networks: application to the design of wind farm cabling networks. (Conception de réseaux robustes: application à des problèmes de câblage dans les parcs éoliens)

  2019cites this paper
• An optimization approach for congestion control in network routing with quality of service requirements

  2019cites this paper
• A polyhedral analysis of the capacitated edge activation problem with uncertain demands

  2019cites this paper
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design

  2019cites this paper
• A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty

  2019cites this paper
• Solving the optimum communication spanning tree problem

  2019cites this paper
• Network design under uncertainty and demand elasticity

  2018cites this paper
• On the chance-constrained minimum spanning k-core problem

  2018cites this paper
• Robust capacitated trees and networks with uniform demands

  2018cites this paper
• k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

  2018cites this paper
• Exact Algorithms for Multicommmodity Uncapacitated Fixed-charge Network Design

  2018cites this paper
• Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints

  2018cites this paper
• The 2 edge-disjoint 3-paths polyhedron

  2018cites this paper
• The capacity formulation of the capacitated edge activation problem

  2018cites this paper
• A tabu search for the design of capacitated rooted survivable planar networks

  2018cites this paper
• Extended formulation for hop constrained distribution network configuration problems

  2018cites this paper
• Exact Algorithms for the Multicommmodity Uncapacitated Fixed-charge Network Design Problem

  2017cites this paper
• Survivable Probability of Network Slicing with Random Physical Link Failure

  2017cites this paper
• Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

  2017cites this paper
• Fixed charge multicommodity network design using p-partition facets

  2017cites this paper
• A formulation for a Hop Constrained Survivable Network Design Problem

  2017influential citation
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization

  2017cites this paper
• Design of survivable networks with vulnerability constraints

  2017cites this paper
• A Polyhedral Study of the Robust Capacitated Edge Activation Problem

  2017cites this paper
• The Minimum Edge Compact Spanner Network Design Problem

  2017cites this paper
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints

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

  2017cites this paper
• Using variables aggregation and Benders decomposition for solving large-scale extended formulations

  2017cites this paper
• Stochastic survivable network design problems: Theory and practice

  2017cites this paper
• Network design in scarce data environment using moment-based distributionally robust optimization

  2017cites this paper
• Combining Worst Case and Average Case Considerations in an Integrated Emergency Response Network Design Problem

  2017cites this paper
• Exact Algorithms for the Multicommodity Uncapacitated Fixed-Charge Network Design Problem

  2017cites this paper
• The Benders decomposition algorithm: A literature review

  2017influential citation
• A branch-and-check approach for a wind turbine maintenance scheduling problem

  2017cites this paper
• Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem

  2017cites this paper
• The 2 edge-disjoint 3-paths polyhedron

  2017cites this paper
• Survivable green traffic engineering with shared protection

  2017cites this paper
• Optimisation of passive optical network design under demand uncertainty

  2016cites this paper
• A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem

  2016cites this paper
• Integer programming formulations for the k‐edge‐connected 3‐hop‐constrained network design problem

  2016cites this paper
• Indirect Taxes for Redistribution: Should Necessity Goods Be Favored?

  2016cites this paper
• Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity

  2016cites this paper
• Comparing tree and chain topologies for designing resilient backhaul access network

  2016cites this paper
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks

  2016cites this paper
• The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures

  2016cites this paper
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem

  2016cites this paper
• Benders Decomposition for Capacitated Network Design

  2016cites this paper
• Maintenance scheduling in the electricity industry : a particular focus on a problem rising in the onshore wind industry. (Planification de la maintenance d'équipements de production d'électricité : une attention particulière portée sur un problème de l'industrie éolienne terrestre)

  2016cites this paper
• Optimization and Machine Learning Frameworks for Complex Network Analysis

  2016cites this paper
• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty

  2016cites this paper