Combinatorial Online Optimization in Real Time
Please always quote using this URN: urn:nbn:de:0297-zib-6424
- Optimization is the task of finding an optimum solution to a given problem. When the decision variables are discrete we speak of a combinatorial optimization problem. Such a problem is online when decisions have to be made before all data of the problem are known. And we speak of a real-time online problem when online decisions have to be computed within very tight time bounds. This paper surveys the are of combinatorial online and real-time optimization, it discusses, in particular, the concepts with which online and real-time algorithms can be analyzed.
Author: | Martin Grötschel, Sven Krumke, Jörg Rambau, Thomas Winter, Uwe Zimmermann |
---|---|
Document Type: | ZIB-Report |
Tag: | Competitive Analysis; Heuristics; Online Optimization; Realtime Optimization; Survey |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B06 Transportation, logistics |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
Date of first Publication: | 2001/07/24 |
Series (Serial Number): | ZIB-Report (01-16) |
ZIB-Reportnumber: | 01-16 |
Published in: | Appeared in: Online Optimization of Large Scale Systems, Springer, 2001 |