Optimizing single-terminal dispatch of large volume trips to trucks
type: Item
instance of: scholarly article
title: Optimizing single-terminal dispatch of large volume trips to trucks
zbMATH Open document ID: 0812.90106
DOI: 10.1007/BF02085653
author: Robert M. Nauss
published in: Annals of Operations Research
publication date: 1995-05-21T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 698922
zbMATH Keywords: truck dispatching
zbMATH Keywords: elastic generalized assignment
zbMATH Keywords: branch-and-bound
zbMATH Keywords: real-world distribution problems
MaRDI profile type: Publication
cites work: Canonical Cuts on the Unit Hypercube
cites work: Improved Lagrangean decomposition: An application to the generalized assignment problem
cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: A new Lagrangian relaxation approach to the generalized assignment problem
cites work: An Efficient Algorithm for the 0-1 Knapsack Problem
cites work: A branch and bound algorithm for the generalized assignment problem
full work available at URL: https://doi.org/10.1007/bf02085653
OpenAlex ID: W1989116145
Wikidata QID: Q126111693
description: scientific article; zbMATH DE number 698922