Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Stephan Held"'
Publikováno v:
Proceedings of the 2022 International Symposium on Physical Design.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4ca7a6357b95ffb829e0fcf56f32488
https://doi.org/10.1145/3505170.3511477
https://doi.org/10.1145/3505170.3511477
Last-mile routing refers to the final step in a supply chain, delivering packages from a depot station to the homes of customers. At the level of a single van driver, the task is a traveling salesman problem. But the choice of route may be constraine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f66f99c5ad34e4164547828b0f4596a
http://arxiv.org/abs/2112.15192
http://arxiv.org/abs/2112.15192
Publikováno v:
Discrete Optimization. 33:87-100
When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items are initially loaded in one vehicle and should be distributed before a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f447c58547b6d02045aad9ed5f1a1bc4
https://doi.org/10.1016/j.disopt.2019.03.003
https://doi.org/10.1016/j.disopt.2019.03.003
Autor:
Stephan Held
Publikováno v:
ELSEVIER ESSENTIALS Geriatrie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a961d1bd3f7925ea6c12e8f94bed1558
https://doi.org/10.1016/b978-3-437-22842-1.00037-9
https://doi.org/10.1016/b978-3-437-22842-1.00037-9
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
IPCO
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an instance is the number of jobs in a longest chain and is denoted by d.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1fd6639b6dcb55260740ebdc295de30
https://doi.org/10.1007/978-3-030-73879-2_3
https://doi.org/10.1007/978-3-030-73879-2_3
Autor:
Stephan Held, Ardalan Khazraei
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030808785
WAOA
WAOA
The cost-distance Steiner tree problem asks for a Steiner tree in a graph that minimizes the total cost plus a weighted sum of path delays from the root to the sinks. We present an improved approximation for the uniform cost-distance Steiner tree pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5a0d4c6057d0e46efd1115d427071ae
https://doi.org/10.1007/978-3-030-80879-2_13
https://doi.org/10.1007/978-3-030-80879-2_13
Autor:
Stephan Held
Publikováno v:
ELSEVIER ESSENTIALS Geriatrie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0e19c61519b3f50d620231a254c390c
https://doi.org/10.1016/b978-3-437-22842-1.00036-7
https://doi.org/10.1016/b978-3-437-22842-1.00036-7
Autor:
Klaus Hager, Olaf Krause, Meiken Brecht, Yuri Alexei Cabanillas Diaz, Valentin Goede, Johannes Heck, Stephan Held, Johannes Hensen, Matthias Karst, Wolfgang Kauffels, Gerald Kolb, Stefan Köppen, Peter Landwehr, Konstantin Lekkos, Wolfgang Lensing, Peter Lüdemann, Marcus Örgel, Maximilian Petri, Gabriele Röhrig-Herzog., Roland Schmitt, Nils Schneider, P.H. Felix Wedegärtner, Thomas Weiss, Ulrike Wendt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03b0b30f2a21eb58354fa7ec893fc114
https://doi.org/10.1016/b978-3-437-22842-1.09990-0
https://doi.org/10.1016/b978-3-437-22842-1.09990-0
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an instance is the number of jobs in a longest chain and is denoted by $d$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79a559a8a695aa5803ca7833ebf7ce83
http://arxiv.org/abs/2011.02446
http://arxiv.org/abs/2011.02446
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 37:3163-3176
We present a new approach for the cell selection problem based on a resource sharing formulation, which is a specialization of Lagrangian relaxation with multiplicative weight updates. For the convex continuous gate sizing problem, we can prove fast
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a22c471b6fc25510d2c40daae83faf6
https://doi.org/10.1109/tcad.2018.2801231
https://doi.org/10.1109/tcad.2018.2801231