Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
Year of publication: |
2021
|
---|---|
Authors: | Ravelo, Santiago V. ; Meneses, Cláudio N. |
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. 135.2021, p. 1-21
|
Subject: | Dynamic programming | Heuristic solution | Integer linear programming | Lagrangian relaxation | Subgradient method | Target set selection | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Dynamische Optimierung |
-
Exact algorithms for a joint order acceptance and scheduling problem
Li, Xin, (2020)
-
An integration of Lagrangian split and VNS : the case of the capacitated vehicle routing problem
Bouzid, Mouaouia Cherif, (2017)
-
Urrutia, Sebastián, (2015)
- More ...
-
Anacleto, Eduardo A. J., (2020)
-
Optimal Solutions for the Closest-String Problem via Integer Programming
Meneses, Cláudio N., (2004)
-
A parallel multistart algorithm for the closest string problem
Gomes, Fernando C., (2008)
- More ...