Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
Year of publication: |
2023
|
---|---|
Authors: | Martins, Isabel ; Alvelos, Filipe Pereira e ; Cerveira, Adelaide ; Kašpar, Jan ; Marušák, Robert |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 30.2023, 6, p. 3930-3948
|
Subject: | branch-and-price | bucket formulation | connectivity | Dantzig-Wolfe decomposition | integer programming | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Dekompositionsverfahren | Decomposition method |
-
Sun, Peter, (2014)
-
Optimal train dispatching by Benders'-like reformulation
Lamorgese, Leonardo, (2016)
-
Integer programming formulations and benders decomposition for the maximum induced matching problem
Ahat, Betül, (2018)
- More ...
-
Forest management with fire simulation
Alvelos, Filipe Pereira e, (2025)
-
A robust optimisation approach for the placement of forest fire suppression resources
Mendes, André Bergsten, (2025)
-
Maximizing the expected number of transplants in kidney exchange programs with branch-and-price
Alvelos, Filipe Pereira e, (2019)
- More ...