On dual solutions of the linear assignment problem
DOI10.1016/0377-2217(85)90310-8zbMATH Open0557.90066OpenAlexW2028068470MaRDI QIDQ761971FDOQ761971
A. Volgenant, V. van Gijlswijk, G. de Leve, G. A. P. Kindervater
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90310-8
Recommendations
- Linear assignment procedures
- A sequential dual simplex algorithm for the linear assignment problem
- scientific article; zbMATH DE number 3989103
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some techniques useful for solution of transportation network problems
- Solving symmetric vehicle routing problems asymmetrically
- A restricted Lagrangean approach to the traveling salesman problem
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Network flow, transportation and scheduling. Theory and algorithms
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- An approach for solving a class of transportation scheduling problems
- An operator theory of parametric programming for the transportation problem-I
- Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Technical Note—Bounds for the Travelling-Salesman Problem
Cited In (16)
- A reduction approach to the repeated assignment problem
- A sequential dual simplex algorithm for the linear assignment problem
- Improving Christofides' lower bound for the traveling salesman problem
- Title not available (Why is that?)
- An addendum on: ``Sensitivity analysis of the optimal assignment
- Title not available (Why is that?)
- A simple dual algorithm for the generalised assignment problem
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
- A labeling algorithm for the sensitivity ranges of the assignment problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- Better assignment lower bounds for the Euclidean traveling salesman problem
- Linear assignment procedures
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Solving some lexicographic multi-objective combinatorial problems
This page was built for publication: On dual solutions of the linear assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761971)
