Approximation algorithms and linear programming relaxations for scheduling problems related to min-sum set cover
Felix Happach, Andreas S. Schulz
| Year of publication: |
2024
|
|---|---|
| Authors: | Happach, Felix ; Schulz, Andreas S. |
| Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 1, p. 578-598
|
| Subject: | approximation algorithm | linear programming relaxation | min-sum set cover | precedence constraints | scheduling | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2023.1368 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014527957