A general framework for approximating min sum ordering problems
Year of publication: |
2022
|
---|---|
Authors: | Happach, Felix ; Hellerstein, Lisa ; Lidbetter, Thomas |
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, 3, p. 1437-1452
|
Subject: | approximation algorithms | Boolean function evaluation | min sum set cover | scheduling | search theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Suchtheorie | Search theory |
-
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
Zhu, Jie, (2009)
-
An adaptive multistart tabu search approach to solve the maximum clique problem
Wu, Qinghua, (2013)
-
A penalty search algorithm for the obstacle neutralization problem
Alkaya, Ali Fuat, (2015)
- More ...
-
Solving zero-sum games using best-response oracles with applications to search games
Hellerstein, Lisa, (2019)
-
A game theoretic approach to a problem in polymatroid maximization
Hellerstein, Lisa, (2023)
-
Makespan minimization with OR-precedence constraints
Happach, Felix, (2021)
- More ...