An approach for solving a class of transportation scheduling problems
type: Item
instance of: scholarly article
title: An approach for solving a class of transportation scheduling problems
zbMATH Open document ID: 0392.90055
DOI: 10.1016/0377-2217(79)90098-5
author: Bezalel Gavish
author: E. Shlifer
published in: European Journal of Operational Research
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 3609454
zbMATH Keywords: Branch-And-Bound
zbMATH Keywords: Transportation Scheduling Problems
zbMATH Keywords: Assignment Problems
MaRDI profile type: Publication
full work available at URL: 0377-2217(79)90098-5
OpenAlex ID: W2045690085
cites work: The Traveling Salesman Problem: A Survey
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Algorithms for Large-scale Travelling Salesman Problems
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Design of linear quadratic regulators with assigned eigenstructure
cites work: The Bottleneck Traveling Salesman Problem
cites work: Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
cites work: The zero pivot phenomenon in transportation and assignment problems and its computational implications
cites work: Branch-and-Bound Methods: A Survey
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Branch-and-Bound Methods: General Formulation and Properties
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
cites work: Computational Experience with an M-Salesman Traveling Salesman Algorithm
description: scientific article; zbMATH DE number 3609454