An iterated dual substitution approach for binary integer programming problems under the min-max regret criterion
Year of publication: |
2022
|
---|---|
Authors: | Wu, Wei ; Iori, Manuel ; Martello, Silvano ; Yagiura, Mutsunori |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 5, p. 2523-2539
|
Subject: | combinatorial optimization | heuristics | iterated dual substitution | min-max regret | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Scheduling-Verfahren | Scheduling problem |
-
Recursive circle packing problems
Pedroso, João Pedro, (2016)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
- More ...
-
Heuristic algorithms based on column generation for an online product shipping problem
Wu, Wei, (2024)
-
Influence of political relationship building on the business activity of firms in China
Wei, Wu, (2008)
-
Wei, Wu, (2011)
- More ...