Metadata language
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: Date issued/created: Description:11 stron ; 21 cm ; Bibliografia s. 10-11
Type of object: 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: Detailed Resource Type: Source: Language: Language of abstract: Rights:Licencja Creative Commons Uznanie autorstwa 4.0
Terms of use:Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Digitizing institution:Instytut Badań Systemowych Polskiej Akademii Nauk
Original in:Biblioteka Instytutu Badań Systemowych PAN
Projects co-financed by: Access:This content is hosted outside the digital library.
Click the link below to view the content.
https://www.ibspan.waw.pl/~alex/OZwRCIN/WA777_174963_RB-2003-60_Algorithm to compute of sets of K - best solution for discrete optimization problem_content.pdf