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

DOI10.1016/J.COR.2003.11.012zbMath1071.90009OpenAlexW2083931873MaRDI QIDQ1764759

Alysson M. Costa

Publication date: 22 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.012

zbMATH Keywords

Benders decompositionNetwork designFixed charge

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (91)

A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato ⋮ A scheme for determining vehicle routes based on Arc-based service network design ⋮ Exact approaches to the single-source network loading problem ⋮ Bilinear modeling solution approach for fixed charge network flow problems ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ Decomposition based hybrid metaheuristics ⋮ Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles ⋮ A note on the selection of Benders' cuts ⋮ Solving a capacitated hub location problem ⋮ The generalized fixed-charge network design problem ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design ⋮ A Benders decomposition algorithm for base station planning problem in WCDMA networks ⋮ Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints ⋮ A hub location problem with fully interconnected backbone and access networks ⋮ The network design problem with relays ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ A Benders decomposition-based approach for logistics service network design ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ Affine routing for robust network design ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A review of decentralized optimization focused on information flows of decomposition algorithms ⋮ Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach ⋮ Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ On generating maximal nondominated Benders cuts ⋮ Optimal engineering design via Benders' decomposition ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ Estimating the parameters of a fatigue model using Benders' decomposition ⋮ Tree network design avoiding congestion ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ The Benders Dual Decomposition Method ⋮ Generalized Benders' decomposition for topology optimization problems ⋮ Service network design models for two-tier city logistics ⋮ Exact algorithms for the joint object placement and request routing problem in content distribution networks ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ Optimization in liner shipping ⋮ Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach ⋮ A Benders Decomposition for Hub Location Problems Arising in Public Transport ⋮ The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ Accelerating benders decomposition with heuristicmaster problem solutions ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Optimization in liner shipping ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ Solving the optimum communication spanning tree problem ⋮ A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea ⋮ Solving minimum-cost shared arborescence problems ⋮ Combinatorial Benders cuts for assembly line balancing problems with setups ⋮ The Benders decomposition algorithm: a literature review ⋮ A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ On the approximability of robust network design ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ تخصیص بودجه ی بهینه به منظور افزایش ایمنی محور شیراز-آباده به روش تجزیه بندر ⋮ Solving network design problems via iterative aggregation ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Modeling interdependencies in infrastructure systems using multi-layered network flows ⋮ Decomposition algorithms for solving the minimum weight maximal matching problem ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ Projective Cutting-Planes ⋮ An improved Benders decomposition applied to a multi-layer network design problem ⋮ A local branching heuristic for the capacitated fixed-charge network design problem ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ Mixed-integer programming approaches for the tree \(t^*\)-spanner problem ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ An L-shaped method with strengthened lift-and-project cuts ⋮ Meta partial Benders decomposition for the logistics service network design problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LP-based heuristic algorithms for interconnecting token rings via source routing bridges
• An integrated model for logistics network design
• Partitioning procedures for solving mixed-variables programming problems
• Distribution system planning through a generalized Benders decomposition approach
• A robustness approach to uncapacitated network design problems
• Exact solution of multicommodity network optimization problems with general step cost functions
• A polyhedral approach to multicommodity survivable network design
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• An augmented arborescence formulation for the two-level network design problem
• A comparison of optimal methods for local access uncapacitated network design
• Multicommodity network expansion under elastic demands
• Generalized Benders decomposition
• Airline Network Design
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• Capacitated Network Design with Uncertain Demand
• Lower planes for the network design problem
• Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method.
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Tailoring Benders decomposition for uncapacitated network design
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Topological design of centralized computer networks—formulations and algorithms
• Multicommodity Distribution System Design by Benders Decomposition
• The Engine Scheduling Problem In A Railway Network
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies
• Composite Variable Formulations for Express Shipment Service Network Design
• A new proximal decomposition algorithm for routing in telecommunication networks
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• On the generalized minimum spanning tree problem
• Network Design Using Cut Inequalities
• Shortest paths, single origin‐destination network design, and associated polyhedra
• A Computational Approach to the Selection of an Optimal Network
• A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
• Capacity and flow assignment of data networks by generalized Benders decomposition

This page was built for publication: A survey on Benders decomposition applied to fixed-charge network design problems