Title:

Computing the Sets of K-Best Solutions for Discrete Optimization Problems

Subtitle:

Raport Badawczy = Research Report ; RB/67/2002

Creator:

Gola, Magdalena

Publisher:

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

Place of publishing:

Warszawa

Date issued/created:

2002

Description:

6 pages ; 21 cm ; Bibliography p. 6

Subject and Keywords:

Optymalizacja dyskretna ; Branch and bound method ; K-best solutions ; Discrete optimization ; Blokowa metoda podziału i ograniczeń

Abstract:

The paper presents Lawer procedure for finding K-best solutions of discrete optimization problem and alternative Hamacher and Queyranne approach. A new algorithm based on the branching and binding method has been introduced.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2002-67

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