Exact algorithms for budgeted prize-collecting covering subgraph problems
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 |
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
-
A branch-and-cut algorithm for the maximum covering cycle problem
Álvarez-Miranda, Eduardo, (2020)
-
Mingozzi, Aristide, (2018)
- More ...
-
An investigation of resource-allocation decisions by means of project networks
Leus, Roel, (2006)
-
Timely exposure of a secret project: Which activities to monitor?
Hermans, Ben, (2019)
-
Models for robust resource allocation in project scheduling
Leus, Roel, (2001)
- More ...