On dual solutions of the linear assignment problem

DOI10.1016/0377-2217(85)90310-8MaRDI QIDQ761971zbMATH OpenOpenAlexFDO

Authors A. Volgenant, G. de Leve, V. van Gijlswijk, 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

zbMATH Keywords

dual solutionstraveling salesmanlinear assignmentshortest path algorithm

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3583204 (Why is no real title available?)
• scientific article; zbMATH DE number 3435247 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A restricted Lagrangean approach to the traveling salesman problem
• An approach for solving a class of transportation scheduling problems
• An exact branch-and-bound procedure for the quadratic-assignment problem
• An operator theory of parametric programming for the transportation problem-I
• Network flow, transportation and scheduling. Theory and algorithms
• On some techniques useful for solution of transportation network problems
• Solving symmetric vehicle routing problems asymmetrically
• Technical Note—Bounds for the Travelling-Salesman Problem
• Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees

Cited in

(16)

• An addendum on: ``Sensitivity analysis of the optimal assignment
• Solving some lexicographic multi-objective combinatorial problems
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• scientific article; zbMATH DE number 3883952 (Why is no real title available?)
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
• scientific article; zbMATH DE number 4167859 (Why is no real title available?)
• A note on dual solutions of the assignment problem in connection with the traveling salesman problem
• A simple dual algorithm for the generalised assignment problem
• A sequential dual simplex algorithm for the linear assignment problem
• Improving Christofides' lower bound for the traveling salesman problem
• An additive bounding procedure for the asymmetric travelling salesman problem
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
• A reduction approach to the repeated assignment problem
• A labeling algorithm for the sensitivity ranges of the assignment problem
• Better assignment lower bounds for the Euclidean traveling salesman problem
• Linear assignment procedures

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)