Service network design in freight transportation
type: Item
instance of: scholarly article
title: Service network design in freight transportation
zbMATH Open document ID: 0961.90010
DOI: 10.1016/S0377-2217(99)00233-7
author: Teodor Gabriel Crainic
published in: European Journal of Operational Research
publication date: 2000-10-03T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1512944
zbMATH Keywords: transportation
zbMATH Keywords: service network design
zbMATH Keywords: freight transportation
zbMATH Keywords: tactical planning
zbMATH Keywords: modelling
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4398375
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: Air Network Design for Express Shipment Service
cites work: A survey of optimization models for train routing and scheduling
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design
cites work: Planning models for freight transportation
cites work: Subgradient Methods for the Service Network Design Problem
cites work: A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: Q4354785
cites work: Q4692508
cites work: An application of genetic and tabu searches to the freight railroad operating plan problem
cites work: Planning models for long-haul operations of postal and express shipment companies
cites work: Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation
cites work: Multimodal Express Package Delivery: A Service Network Design Application
cites work: Q3785827
cites work: A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
cites work: The convex hull of two core capacitated network design problems
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: Q4845371
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Constructing railroad blocking plans to minimize handling costs
cites work: Shipment Routing Algorithms with Tree Constraints
cites work: Q3992496
Wikidata QID: Q126645317
description: scientific article; zbMATH DE number 1512944