A survey on Benders decomposition applied to fixed-charge network design problems
type: Item
instance of: scholarly article
title: A survey on Benders decomposition applied to fixed-charge network design problems
zbMATH Open document ID: 1071.90009
author: Alysson M. Costa
published in: Computers \& Operations Research
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 2136905
zbMATH Keywords: Benders decomposition
zbMATH Keywords: Network design
zbMATH Keywords: Fixed charge
MaRDI profile type: Publication
full work available at URL: j.cor.2003.11.012
OpenAlex ID: W2083931873
cites work: Airline network design
cites work: Composite Variable Formulations for Express Shipment Service Network Design
cites work: A comparison of optimal methods for local access uncapacitated network design
cites work: Benders decomposition for local access network design with two technologies
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: On the generalized minimum spanning tree problem
cites work: Electricity Distribution Planning Model: A Network Design Approach For Solving The Master Problem Of The Benders Decomposition Method.
cites work: Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: An integrated model for logistics network design
cites work: The Engine Scheduling Problem In A Railway Network
cites work: A Benders decomposition approach for the locomotive and car assignment problem
cites work: Simultaneous Assignment of Locomotives and Cars to Passenger Trains
cites work: A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
cites work: Generalized Benders decomposition
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Tailoring Benders decomposition for uncapacitated network design
cites work: A Computational Approach to the Selection of an Optimal Network
cites work: Lower planes for the network design problem
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: Q4398375
cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
cites work: Benders-and-cut algorithm for fixed-charge capacitated network design problem
cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
cites work: A robustness approach to uncapacitated network design problems
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: An augmented arborescence formulation for the two-level network design problem
cites work: Capacitated network design with uncertain demand
cites work: Shortest paths, single origin‐destination network design, and associated polyhedra
cites work: Network Design Using Cut Inequalities
cites work: LP-based heuristic algorithms for interconnecting token rings via source routing bridges
cites work: Multicommodity network expansion under elastic demands
cites work: A new proximal decomposition algorithm for routing in telecommunication networks
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: A polyhedral approach to multicommodity survivable network design
cites work: Exact solution of multicommodity network optimization problems with general step cost functions
cites work: Capacity and flow assignment of data networks by generalized Benders decomposition
cites work: Distribution system planning through a generalized Benders decomposition approach
cites work: Q4495146
DOI: 10.1016/J.COR.2003.11.012
description: scientific article; zbMATH DE number 2136905