Exact and approximation algorithms for the expanding search problem
Year of publication: |
2022
|
---|---|
Authors: | Hermans, Ben ; Leus, Roel ; Matuschke, Jannik |
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, 1, p. 281-296
|
Subject: | approximation algorithms | branch-and-cut | network optimization | search problems | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
A general framework for approximating min sum ordering problems
Happach, Felix, (2022)
-
A family of search directions for Karmarkar's algorithm
Anstreicher, Kurt M., (1990)
-
Baskar, A., (2022)
- More ...
-
Exact and approximation algorithms for the expanding search problem
Hermans, Ben, (2019)
-
Timely exposure of a secret project: Which activities to monitor?
Hermans, Ben, (2019)
-
A pessimist's approach to one-sided matching
Demeulemeester, Tom, (2023)
- More ...