Optimizing single-terminal dispatch of large volume trips to trucks

DOI10.1007/BF02085653zbMath0812.90106OpenAlexW1989116145WikidataQ126111693 ScholiaQ126111693MaRDI QIDQ1339147

Robert M. Nauss

Publication date: 21 May 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02085653

zbMATH Keywords

branch-and-boundelastic generalized assignmentreal-world distribution problemstruck dispatching

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Cites Work

• Improved Lagrangean decomposition: An application to the generalized assignment problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Canonical Cuts on the Unit Hypercube
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: Optimizing single-terminal dispatch of large volume trips to trucks