Title:

Algorithm to compute of sets of K - best solution for discrete optimization problem

Subtitle:

Raport Badawczy = Research Report ; RB/60/2003

Creator:

Gola, Magdalena : Autor ; Nycz, Piotr : Autor

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2003

Description:

11 pages ; 21 cm ; Bibliography p. 10-11

Type of object:

Book/Chapter

Subject and Keywords:

Branch and bound method ; K-best solutions ; Postoptimality analysis

Abstract:

In this paper we study k-best solutions discrete optimization problems, that is, for a given discrete optimization problem, we wish to know not only the optimal solution but also the second best solution, and generally K best solutions, for K in N. We analyzed this problem and suggest an algorithm which uses branch-and-bound methods.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2003-60

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open