An approach for solving a class of transportation scheduling problems
From MaRDI portal
Publication:1251987
DOI10.1016/0377-2217(79)90098-5zbMath0392.90055OpenAlexW2045690085MaRDI QIDQ1251987
Publication date: 1979
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(79)90098-5
Related Items
Heuristics for unequal weight delivery problems with a fixed error guarantee, Bi-objective min-flow problem with capacity and flow constraints, Vehicle scheduling based on variable trip times with expected on-time performance, A network model for nursing staff scheduling, An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems, Public transit planning and scheduling based on AVL data in China, On dual solutions of the linear assignment problem, The school bus routing problem: a review, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, Topological design of ring networks
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- The Bottleneck Traveling Salesman Problem
- Design of linear quadratic regulators with assigned eigenstructure
- Solution of a Large-Scale Traveling-Salesman Problem
- Branch-and-Bound Methods: A Survey
- An Algorithm for the Traveling Salesman Problem
- The Traveling Salesman Problem: A Survey
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Branch-and-Bound Methods: General Formulation and Properties
- Algorithms for Large-scale Travelling Salesman Problems
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
