scientific article; zbMATH DE number 1175958

zbMath1068.90503MaRDI QIDQ4398375

Thomas L. Magnanti, Prakash Mirchandani, Anantaram Balakrishnan

Publication date: 19 July 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items (25)

Graceful reassignment of excessively long communications paths in networks ⋮ A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem ⋮ The network design problem with relays ⋮ General network design: a unified view of combined location and network design problems ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem ⋮ Benders, metric and cutset inequalities for multicommodity capacitated network design ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ The Steiner connectivity problem ⋮ Solving railroad blocking problem using ant colony optimization algorithm ⋮ A hybrid algorithm for large-scale service network design considering a heterogeneous fleet ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Metric inequalities and the network loading problem ⋮ Service network design with management and coordination of multiple fleets ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ A first multilevel cooperative algorithm for capacitated multicommodity network design ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ Service network design in freight transportation ⋮ Planning models for long-haul operations of postal and express shipment companies ⋮ The single-node dynamic service scheduling and dispatching problem ⋮ Diversification strategies in local search for a nonbifurcated network loading problem

This page was built for publication: