Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Felix G. König"'
Publikováno v:
Transportation Science. 50:439-460
We propose a new mathematical model for transport optimization in logistics networks on the tactical level. The main features include accurately modeled tariff structures and the integration of spatial and temporal consolidation effects via a cyclic
Publikováno v:
Operations Research Proceedings ISBN: 9783319429014
OR
OR
In this paper we propose key figures to compare two different partitions of street maps. The first partition is used in navigation and reduce the cutting edges in the partition. The second is dependent on a new standard for the transmission of naviga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e7a46bd684bf264dd7dc51cb1b21987
https://doi.org/10.1007/978-3-319-42902-1_30
https://doi.org/10.1007/978-3-319-42902-1_30
Publikováno v:
Journal of Combinatorial Optimization. 27:164-181
We study the problems of non-preemptively scheduling and packing malleable and parallel tasks with precedence constraints to minimize the makespan. In the scheduling variant, we allow the free choice of processors; in packing, each task must be assig
Publikováno v:
Management Science. 57:647-666
We consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of colors necessitate time-consuming setup work. In most c
Publikováno v:
ITSC
The effect of traffic in routing, either for individuals or fleets, becomes more and more noticeable as the social, economical, and the ecological effects that it has, seem to be crucial. Forecasting travel times is an interesting, yet challenging pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f52b056674d678e4bff6b46f950be4c8
Publikováno v:
Transportation Science, 47(1), 3-22. INFORMS
An approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8dff3dfffeac9314bdf8d85ff18177f4
https://cris.maastrichtuniversity.nl/en/publications/fb7494b0-a137-4f2c-9d43-05ea374ba025
https://cris.maastrichtuniversity.nl/en/publications/fb7494b0-a137-4f2c-9d43-05ea374ba025
Autor:
Torsten J. Gellert, Felix G. König
Publikováno v:
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ISBN: 9781611972917
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c18eb53b745474f9595a8660f6025fa
https://doi.org/10.1137/1.9781611972917.11
https://doi.org/10.1137/1.9781611972917.11
Autor:
Felix G. König
Publikováno v:
Operations Research Proceedings ISBN: 9783540699941
OR
OR
The optimization of traffic flow in congested urban road networks faces a well-known dilemma: Optimizing system performance is unfair with respect to the individual drivers’ travel times; and a fair user equilibrium may result in bad system perform
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::841669f9617966dbff87623e684b4531
https://doi.org/10.1007/978-3-540-69995-8_8
https://doi.org/10.1007/978-3-540-69995-8_8
Publikováno v:
Algorithms – ESA 2007 ISBN: 9783540755197
ESA
ESA
We investigate a complex stacking problem that stems from storage planning of steel slabs in integrated steel production. Besides the practical importance of such stacking tasks, they are appealing from a theoretical point of view. We show that alrea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7ddb9e0b939d072a40b5040b59eb18a
https://doi.org/10.1007/978-3-540-75520-3_64
https://doi.org/10.1007/978-3-540-75520-3_64
Autor:
Marco E. Lübbecke, Felix G. König
Publikováno v:
Algorithms and Computation ISBN: 9783540921813
ISAAC
ISAAC
Knuth introduced the problem of sorting numbers using a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28fb2ea33755e84fcb3c603839ad89e1