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

Authors:
Alysson M. Costa
Affiliations:
Canada Research Chair in Distribution Management, HEC Montréal, Chemin de la Côte-Sainte-Catherine, Montréal, Canada
Venue:
Computers and Operations Research
Year:
2005

Citing 13
Cited 18

Data networks

Data networks
Modeling and heuristic worst-case performance analysis of the two-level network design problem

Management Science
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Network Design Using Cut Inequalities

SIAM Journal on Optimization
LP-Based Heuristic Algorithms for Interconnecting Token Rings viaSource Routing Bridges

Journal of Heuristics
Capacity and flow assignment of data networks by generalized Benders decomposition

Journal of Global Optimization
Airline Network Design

Operations Research
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

Transportation Science
Simultaneous Assignment of Locomotives and Cars to Passenger Trains

Operations Research
Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition

Operations Research
Composite Variable Formulations for Express Shipment Service Network Design

Transportation Science
Capacitated Network Design with Uncertain Demand

INFORMS Journal on Computing
Exact solution of multicommodity network optimization problems with general step cost functions

Operations Research Letters

A hub location problem with fully interconnected backbone and access networks

Computers and Operations Research
Exact algorithms for the joint object placement and request routing problem in content distribution networks

Computers and Operations Research
Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design

Computers and Operations Research
Benders decomposition applied to multi-commodity, multi-mode distribution planning

Expert Systems with Applications: An International Journal
Accelerating Benders Decomposition by Local Branching

INFORMS Journal on Computing
A local branching heuristic for the capacitated fixed-charge network design problem

Computers and Operations Research
Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version

Computers and Operations Research
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment

INFORMS Journal on Computing
Minimal-cost network flow problems with variable lower bounds on arc flows

Computers and Operations Research
Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems

Expert Systems with Applications: An International Journal
Generalized Benders' Decomposition for topology optimization problems

Journal of Global Optimization
Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design

Mathematical and Computer Modelling: An International Journal
An improved Benders decomposition applied to a multi-layer network design problem

Operations Research Letters
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design

Applied Soft Computing
DAHM: A green and dynamic web application hosting manager across geographically distributed data centers

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

Journal of Combinatorial Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

INFORMS Journal on Computing
Assembly line balancing under uncertainty: Robust optimization models and exact solution method

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Network design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin-destination pair demands. Benders decomposition methods, based on the idea of partition and delayed constraint generation, have been successfully applied to many of these problems. This article presents a review of these applications.