Exact algorithms for budgeted prize-collecting covering subgraph problems
N. Morandi, R. Leus, H. Yaman
| Year of publication: |
2022
|
|---|---|
| Authors: | Morandi, N. ; Leus, Roel ; Yaman, H. |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 144.2022, p. 1-11
|
| Subject: | Benders decomposition | Branch-and-cut | Budget | Covering problems | Prize-collecting problems | Symmetry breaking | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm | Theorie | Theory | Öffentlicher Haushalt | Public budget | Ganzzahlige Optimierung | Integer programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2022.105798 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013264814