Global tolerances in the problems of combinatorial optimization with an additive objective function

DOI10.1134/S106456241205002XzbMath1259.90110MaRDI QIDQ1930843

Panos M. Pardalos, Boris I. Goldengorin, Vyacheslav V. Chistyakov

Publication date: 14 January 2013

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

uniqueness of the optimal solutionglobal tolerancenonembeddedness assumption

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Stability analysis in discrete optimization involving generalized addition operations

Cites Work

• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
• Lower tolerance-based branch and bound algorithms for the ATSP
• Tolerance-based branch and bound algorithms for the ATSP
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Tolerance-based Algorithms for the Traveling Salesman Problem
• A note on Arc tolerances in sparse shortest-path and network flow problems
• Arc tolerances in shortest path and network flow problems
• An Algorithm for the Three-Index Assignment Problem

This page was built for publication: Global tolerances in the problems of combinatorial optimization with an additive objective function