РОЗВ’ЯЗАННЯ ЗАДАЧІ ПРО РАНЕЦЬ: ПОСТОПТИМАЛЬНИЙ АНАЛІЗ ТА МЕТОД ГІЛОК І МЕЖ
It is proposed an algorithm of postoptimality analysis for determining exact solutions of family of knapsack problems including an initial problem. Computational experiment shows that the middle time of solving the problem of family at least 10 times less than time of solving initial problem by bran...
Gespeichert in:
| Datum: | 2025 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
2025
|
| Online Zugang: | https://jais.net.ua/index.php/files/article/view/609 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Problems of Control and Informatics |
Institution
Problems of Control and Informatics| Zusammenfassung: | It is proposed an algorithm of postoptimality analysis for determining exact solutions of family of knapsack problems including an initial problem. Computational experiment shows that the middle time of solving the problem of family at least 10 times less than time of solving initial problem by branch and bound method. |
|---|