scientific article; zbMATH DE number 1175958

zbMATH Open1068.90503MaRDI QIDQ4398375FDOQ4398375

Authors: Anantaram Balakrishnan, Thomas L. Magnanti, P. Mirchandani 

Publication date: 19 July 1998

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (25)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398375)