Title | ||
---|---|---|
Extremal values of global tolerances in combinatorial optimization with an additive objective function. |
Abstract | ||
---|---|---|
The currently adopted notion of a tolerance in combinatorial optimization is defined referring to an arbitrarily chosen optimal solution, i.e., locally. In this paper we introduce global tolerances with respect to the set of all optimal solutions, and show that the assumption of nonembededdness of the set of feasible solutions in the provided relations between the extremal values of upper and lower global tolerances can be relaxed. The equality between globally and locally defined tolerances provides a new criterion for the multiplicity (uniqueness) of the set of optimal solutions to the problem under consideration. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/s10898-012-9847-x | J. Global Optimization |
Keywords | Field | DocType |
Combinatorial optimization problem,Additive objective function,Extremal values of tolerances | Uniqueness,Mathematical optimization,Combinatorial optimization problem,Multiplicity (mathematics),Combinatorial optimization,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
53 | 3 | 0925-5001 |
Citations | PageRank | References |
1 | 0.37 | 16 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vyacheslav V. Chistyakov | 1 | 8 | 2.55 |
Boris Goldengorin | 2 | 182 | 17.58 |
Panos M. Pardalos | 3 | 3720 | 397.84 |