A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
From MaRDI portal
Publication:4731020
DOI10.1287/opre.37.5.716zbMath0681.90083OpenAlexW2108303241MaRDI QIDQ4731020
Thomas L. Magnanti, Richard T. Wong, Anantaram Balakrishnan
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.5.716
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10)
Related Items (52)
Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs ⋮ A tabu search procedure for multicommodity location/allocation with balancing requirements ⋮ Topological design of a two-level network with ring-star configuration ⋮ Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ A monotonic, dual-based bounding procedure for integer programs ⋮ Models and algorithms for network reduction ⋮ Reload cost trees and network design ⋮ The generalized fixed-charge network design problem ⋮ Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem ⋮ Routing and capacity assignment in backbone communication networks ⋮ Benders decomposition for network design covering problems ⋮ General network design: a unified view of combined location and network design problems ⋮ Lagrangean bounds for the optimum communication spanning tree problem ⋮ Some thoughts on combinatorial optimisation ⋮ Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol ⋮ Matheuristics: survey and synthesis ⋮ Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study ⋮ Container shipping service selection and cargo routing with transshipment limits ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems ⋮ Stronger MIP formulations for the Steiner forest problem ⋮ Finding minimum cost directed trees with demands and capacities ⋮ An Exact Algorithm for the Steiner Forest Problem ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Survivable networks, linear programming relaxations and the parsimonious property ⋮ A multicast problem with shared risk cost ⋮ Capacitated facility location/network design problems. ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ Concurrent optimization of harvesting and road network layouts under steep terrain ⋮ Solving multiple scenarios in a combinatorial auction ⋮ Primary and secondary route selection in backbone communication networks ⋮ Multicommodity flow models for spanning trees with hop constraints ⋮ A dual ascent approach to the fixed-charge capacitated network design problem ⋮ Planning models for freight transportation ⋮ An effective linear approximation method for separable programming problems ⋮ Design of a distributed finer transport network with hubbing topology ⋮ Service network design in freight transportation ⋮ Memetic algorithms ⋮ Primal convergence from dual subgradient methods for convex optimization ⋮ A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem ⋮ A technique for speeding up the solution of the Lagrangean dual ⋮ Models for planning capacity expansion in local access telecommunication networks ⋮ Scatter search for network design problem ⋮ About Lagrangian methods in integer optimization
This page was built for publication: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
