Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem
Year of publication: |
2025
|
---|---|
Authors: | Montemanni, Roberto ; Smith, Derek H. |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 178.2025, Art.-No. 107010, p. 1-6
|
Subject: | 0-1 Knapsack | Mixed integer linear programming | Model-based algorithms | Time-bomb | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Hamzadayı, Alper, (2020)
-
Esmaelian, Majid, (2021)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
- More ...
-
Heuristic manipulation, tabu search and frequency assignment
Montemanni, Roberto, (2010)
-
A model-based algorithm for the Probabilistic Orienteering Problem
Montemanni, Roberto, (2025)
-
A compact model for the clustered orienteering problem
Montemanni, Roberto, (2024)
- More ...