Extremal values of global tolerances in combinatorial optimization with an additive objective function

DOI10.1007/S10898-012-9847-XzbMATH Open1275.90078OpenAlexW2164948952MaRDI QIDQ453633FDOQ453633

Authors V. V. Chistyakov, Boris Goldengorin, Panos M. Pardalos 

Publication date 27 September 2012

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9847-x

zbMATH Keywords

combinatorial optimization problemadditive objective functionextremal values of tolerances

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Recommendations

• Global tolerances in the problems of combinatorial optimization with an additive objective function
• Some Basics on Tolerances
• Extending single tolerances to set tolerances
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• A note on robustness tolerances for combinatorial optimization problems

Cites work

• scientific article; zbMATH DE number 3165920 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3634009 (Why is no real title available?)
• scientific article; zbMATH DE number 1114459 (Why is no real title available?)
• A note on Arc tolerances in sparse shortest-path and network flow problems
• A note on robustness tolerances for combinatorial optimization problems
• An Algorithm for the Three-Index Assignment Problem
• An Algorithm for the Traveling Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Arc tolerances in shortest path and network flow problems
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Graph-Theoretic Concepts in Computer Science
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Lower tolerance-based branch and bound algorithms for the ATSP
• On the complexity of postoptimality analysis of \(0/1\) programs
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Solving the \(k\)-best traveling salesman problem
• Tolerance-based branch and bound algorithms for the ATSP
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems

Cited in

(5)

• Some Basics on Tolerances
• Stability analysis in discrete optimization involving generalized addition operations
• Extending single tolerances to set tolerances
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• Global tolerances in the problems of combinatorial optimization with an additive objective function

Describes a project that uses

Uses Software

• LKH
• LOLIB

This page was built for publication: Extremal values of global tolerances in combinatorial optimization with an additive objective function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453633)