Subgradient Methods for the Service Network Design Problem

DOI10.1287/TRSC.28.3.256MaRDI QIDQ4319316zbMATH OpenOpenAlexFDO

Authors Judith M. Farvolden, Warren Powell

Publication date 11 January 1995

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.28.3.256

zbMATH Keywords

local-improvement heuristicsmulticommodity network flowroutingservice network designsubgradients

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22) Programming involving graphs or networks (90C35)

Recommendations

• Lagrange dual bound computation for stochastic service network design
• scientific article; zbMATH DE number 1163719
• scientific article; zbMATH DE number 1002205
• Service-constrained network design problems
• Convex approach with sub-gradient method to robust service system design
• Approximate subgradient methods for nonlinearly constrained network flow problems
• On the optimality of the sequential approach for network design problems of service operations
• A note on the subadditive network design problem
• The Continuous-Time Service Network Design Problem
• A subgradient method for solving multiproduct network development problems with survivability guarantees

Cited in

(17)

• 0-1 reformulations of the multicommodity capacitated network design problem
• Planning models for freight transportation
• A subgradient method for solving multiproduct network development problems with survivability guarantees
• Service network design in freight transportation
• Planning models for long-haul operations of postal and express shipment companies
• Meta partial Benders decomposition for the logistics service network design problem
• Near real-time loadplan adjustments for less-than-truckload carriers
• Integrated shipment dispatching and packing problems: a case study
• Service network design for freight transportation: a review
• A first multilevel cooperative algorithm for capacitated multicommodity network design
• The single-node dynamic service scheduling and dispatching problem
• Lagrange dual bound computation for stochastic service network design
• CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
• The Continuous-Time Service Network Design Problem
• Stochastic network design for planning scheduled transportation services: the value of deterministic solutions
• A metaheuristic for stochastic service network design
• About Lagrangian methods in integer optimization

Describes a project that uses

Uses Software

• KORBX
• MINOS

This page was built for publication: Subgradient Methods for the Service Network Design Problem

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