A survey on benders decomposition applied to fixed-charge network design problems

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Computers & Operations Research

• Publication date

  2005-06-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.cor.2003.11.012
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An integrated model for logistics network design

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

  2005cited by this paper
• The generalized minimum spanning tree problem

  2002cited by this paper
• Composite Variable Formulations for Express Shipment Service Network Design

  2002cited by this paper
• Capacitated Network Design with Uncertain Demand

  2002cited by this paper
• Capacity and flow assignment of data networks by generalized Benders decomposition

  2001cited by this paper
• Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition

  2001cited by this paper
• An Augmented Arborescence Formulation for the Two-Level Network Design Problem

  2001cited by this paper
• Multicommodity Network Expansion under Elastic Demands

  2001cited by this paper
• A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs

  2001cited by this paper
• A New Benders Decomposition Approach to Solve Power Transmission Network Design Problems

  2001influential reference
• A Comparison of Optimal Methods for Local Access Uncapacitated Network Design

  2001influential reference
• Benders decomposition for local access network design with two technologies

  2001influential reference
• LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges

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

  2000cited by this paper
• Benders-and-cut algorithm for fixed-charge capacitated network design problem

  2000influential reference
• Multicommodity Capacitated Network Design

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

  1999cited by this paper
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

  1998cited by this paper
• Airline Network Design

  1998cited by this paper
• A new proximal decomposition algorithm for routing in telecommunication networks

  1998cited by this paper
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains

  1998cited by this paper
• Telecommunications Network Planning

  1998cited by this paper
• Using generalized capacitated trees for designing the topology of local access networks

  1997influential reference
• Annotated Bibliographies in Combinatorial Optimization

  1997cited by this paper
• Network Design Using Cut Inequalities

  1996cited by this paper
• A robustness approach to uncapacitated network design problems

  1996cited by this paper
• LONG-RANGE PLANNING OF POWER DISTRIBUTION SYSTEMS: SECONDARY NETWORKS

  1996cited by this paper
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem

  1995cited by this paper
• On the generalized minimum spanning tree problem

  1995cited by this paper
• Large scale transmission network planning using optimization and heuristic techniques

  1995cited by this paper
• Minimization of energy losses in electric power distribution systems by intelligent search strategies

  1995cited by this paper
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem

  1995cited by this paper
• A zero-one implicit enumeration method for optimizing investments in transmission expansion planning

  1994cited by this paper
• Modeling and heuristic worst-case performance analysis of the two-level network design problem

  1994cited by this paper
• A polyhedral approach to multicommodity survivable network design

  1994influential reference
• A hierarchical decomposition approach for transmission network expansion planning

  1994influential reference
• Electricity distribution planning model: a network design approach solving the master problem of the benders decomposition method

  1993cited by this paper
• Shortest paths, single origin-destination network design, and associated polyhedra

  1993cited by this paper
• Distribution system planning through a generalized Benders decomposition approach

  1992cited by this paper
• NETWORK DESIGN AND TRANSPORTATION PLANNING

  1990cited by this paper
• Networks synthesis and optimum network design problems: Models, solution methods and applications

  1989cited by this paper
• Tailoring Benders decomposition for uncapacitated network design

  1986influential reference
• Data Networks

  1986cited by this paper
• A Decomposition Approach To Automated Generation/Transmission Expansion Planning

  1985cited by this paper
• Network Design and Transportation Planning: Models and Algorithms

  1984cited by this paper
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

  1983cited by this paper
• Lower planes for the network design problem

  1983cited by this paper
• Topological design of centralized computer networks - formulations and algorithms

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

  1981influential reference
• Topological optimization of networks: A nonlinear mixed integer model employing generalized benders decomposition

  1980influential reference
• Topological optimization of networks: A nonlinear mixed integer model employing generalized benders

  1980cited by this paper
• The engine scheduling problem in a railway network

  1976cited by this paper
• An Algorithm for the Traffic Assignment Problem

  1974cited by this paper
• Multicommodity Distribution System Design by Benders Decomposition

  1974cited by this paper
• A Computational Approach to the Selection of an Optimal Network

  1973cited by this paper
• Optimal Network Problem: A Branch-and-Bound Algorithm

  1973cited by this paper
• Generalized Benders decomposition

  1972cited by this paper
• On feasibility conditions of multicommodity flows in networks

  1971cited by this paper

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

  2026influential citation
• Incremental expansion of large scale fixed and mobile charging infrastructure in stochastic environments: A novel graph-based Benders decomposition approach

  2025cites this paper
• Approximating value functions via corner Benders'cuts

  2025cites this paper
• A Solution Space Decomposition Method to Find the Best K Fixed-Charge Network Designs

  2025cites this paper
• Literature review on Benders cut selection and a multiple cut generation scheme

  2025cites this paper
• Accelerated Benders decomposition algorithm for the reliable service network design problem under disruption

  2025cites this paper
• An Exact Algorithm for Multicommodity Network Design Under Stochastic Interdictions

  2025cites this paper
• Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages

  2025cites this paper
• Lagrangian relaxation approaches for network design problem considering travel time variability

  2025cites this paper
• Enhancing V2X QoS: A Dual Approach of Packet Duplication and Dynamic RAN Slicing in B5G

  2024cites this paper
• Last fifty years of integer linear programming: A focus on recent practical advances

  2024cites this paper
• Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design

  2024cites this paper
• Designing a sustainable supply chain for battery PVC cases: A multi-objective optimization approach

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

  2024cites this paper
• Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency

  2024cites this paper
• Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing

  2024cites this paper
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing

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

  2023influential citation
• Routing and Slot Allocation in 5G Hard Slicing

  2023cites this paper
• High-Speed Rail Express Transshipment Hub Location and Transportation Timeliness Evaluation

  2023cites this paper
• A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design

  2023cites this paper
• A review of decentralized optimization focused on information flows of decomposition algorithms

  2023cites this paper
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems

  2023cites this paper
• Mathematical formulations for consistent travelling salesman problems

  2023cites this paper
• A Stochastic Benders Decomposition Scheme for Large-Scale Data-Driven Network Design

  2023cites this paper
• Impact Of Distributed Generation on Coordination of Overcurrent Relays by Benders Decomposition Algorithm

  2023cites this paper
• SO-RAN: Dynamic RAN Slicing via Joint Functional Splitting and MEC Placement

  2023cites this paper
• Operational Research: methods and applications

  2023cites this paper
• Lagrangean Relaxation Algorithms for Fixed-Charge Capacitated Relay Network Design

  2023cites this paper
• Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach

  2023cites this paper
• Branch-and-Price for the Stochastic TSP with Generalized Latency

  2023cites this paper
• Optimizing a shared freight and passenger high-speed railway system: A multi-commodity flow formulation with Benders decomposition solution approach

  2023cites this paper
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm

  2022cites this paper
• Cost-Aware Placement Optimization of Edge Servers for IoT Services in Wireless Metropolitan Area Networks

  2022cites this paper
• An L-shaped method with strengthened lift-and-project cuts

  2022cites this paper
• An FGM decomposition-based fuzzy MCDM method for selecting smart technology applications to support mobile health care during and after the COVID-19 pandemic

  2022cites this paper
• Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs

  2022cites this paper
• Robust and Fault-Tolerant Fog Design and Dimensioning for Reliable Operation

  2022cites this paper
• Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach

  2022cites this paper
• A Capacitated Mobile Facility Location Problem with Mobile Demand: Recurrent Service Provision to En Route Refugees

  2022cites this paper
• An exact method for job sequencing in a mixed-model assembly line considering feeding lines based on the Benders decomposition approach

  2022cites this paper
• A Benders decomposition algorithm for the maximum availability service facility location problem

  2022cites this paper
• A survey on Benders Decomposition methods applied to Assembly Line Balancing Problems

  2022cites this paper
• Hybrid Quantum Benders’ Decomposition For Mixed-integer Linear Programming

  2021cites this paper
• Optimization algorithms for advanced behavioral demand models

  2021cites this paper
• An Approach for Solving the Fixed Charge Transportation Problems

  2021cites this paper
• Multi-warehouse package consolidation for split orders in online retailing

  2021cites this paper
• Solving the Shipment Rerouting Problem with Quantum Optimization Techniques

  2021cites this paper
• Affine routing for robust network design

  2021cites this paper
• A scaleable projection-based branch-and-cut algorithm for the p-center problem

  2021cites this paper
• A robust optimization model for distribution network design under a mixed integer set of scenarios

  2021cites this paper
• Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem

  2021cites this paper
• Scalable algorithms for designing CO2 capture and storage infrastructure

  2021cites this paper
• Network scheduling problem with cross-docking and loading constraints

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

  2021cites this paper
• Enhancing large neighbourhood search heuristics for Benders’ decomposition

  2021cites this paper
• A Benders Decomposition Algorithm for the Passenger Train Service Planning

  2021cites this paper
• The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms

  2021cites this paper
• Solving the Unit Commitment and Economic Dispatch Problems by Applying a Novel Weighted Decomposition Method

  2021cites this paper
• New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem

  2021cites this paper
• Benders decomposition for choice-based optimiza- tion problems with discrete upper-level variables

  2021cites this paper
• A Benders-Decomposition and Meta-Heuristic Algorithm for a Bi- Objective Stochastic Reliable Capacitated Facility Location Problem Not Dealing with Benders Feasibility-Cut Stage

  2021cites this paper
• Directed fixed charge multicommodity network design: A cutting plane approach using polar duality

  2021cites this paper
• LUIZA BERNARDES REAL DOIS PROBLEMAS DE LOCALIZAÇÃO DE CONCENTRADORES PARA SISTEMAS DE TRANSPORTE

  2020cites this paper
• Optimal Design and Synthesis of MEA Power System Architectures Considering Reliability Specifications

  2020cites this paper
• Meta Partial Benders Decomposition for the Logistics Service Network Design Problem

  2020cites this paper
• Benders and its sub-problems

  2020cites this paper
• A Heuristic Algorithm for solving Integer Linear Programming Problem and Unveiling the Applications

  2020cites this paper
• A scenario-based stochastic programming approach for aircraft expendable and rotable spare parts planning in MRO provider

  2020cites this paper
• Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy

  2020cites this paper
• A Benders decomposition-based approach for logistics service network design

  2020cites this paper
• Assessing the suitability of smart technology applications for e-health using a judgment-decomposition analytic hierarchy process approach

  2020cites this paper
• Semi-liner Shipping Service Design

  2020cites this paper
• Modeling interdependencies in infrastructure systems using multi-layered network flows

  2020cites this paper
• Projective Cutting-Planes

  2020cites this paper
• Linear Power Flow Characterization of DC Power Distribution Systems for More Electric Aircraft Optimization

  2020cites this paper
• Optimal Location of Safety Landing Sites

  2020cites this paper
• The Benders Dual Decomposition Method

  2020influential citation
• A stochastic programming approach for heterogeneous variable message sign location problem for freeway networks

  2020cites this paper
• On the Approximability of Robust Network Design

  2020cites this paper
• Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

  2019cites this paper
• Collaborative and multilevel optimizations of a hybrid railway power substation

  2019cites this paper
• Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty

  2019cites this paper
• Contributions to robust and bilevel optimization models for decision-making

  2019cites this paper
• Lagrangian-based methods for single and multi-layer multicommodity capacitated network design

  2019cites this paper
• Design of More Electric Aircraft DC Power Distribution Architectures considering Reliability Performance

  2019cites this paper
• A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand Losses

  2019cites this paper
• Consolidation problems in freight transportation systems: mathematical models and algorithms

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

  2019cites this paper
• Survivable multi-commodity network flow design: case of node capacities and arc failure

  2019cites this paper
• Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern

  2019cites this paper
• Considering User Distribution and Cost Awareness to Optimize Server Deployment

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

  2019cites this paper
• Optimizing Train Formation Problem With Car Flow Routing and Train Routing by Benders-and-Price Approach

  2019influential citation
• Using Bender’s Decomposition for Optimal Power Control and Routing in Multihop D2D Cellular Systems

  2019cites this paper
• Mathematical Programming for tactical Transportation Planning in a Multi-Product supply Chain. (Programmation Mathematique pour la planification tactique du transport dans une chaine logistique Multi-produits)

  2019cites this paper
• References

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

  2019cites this paper
• A combined fast greedy heuristic for the capacitated multicommodity network design problem

  2019cites this paper
• Formulations and Benders Decomposition based Procedures for the Discrete Cost Multicommodity Network Design Problem

  2019cites this paper