Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Rambau, J."'
Die Auswahl eines erfolgversprechenden Matchplans spielt im Spitzensport eine immer gr����ere Rolle. Mathematische Optimierung und Spieltheorie kann diese Auswahl fundiert unterst��tzen.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbbdf412e508944e1e668a5062fba3a2
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Applied Mathematics 2001 113(1):87-107
We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of availab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2a27411a579cebef08ca0968346a602
http://arxiv.org/abs/1401.5572
http://arxiv.org/abs/1401.5572
Autor:
Kurz, Sascha, Rambau, J��rg
We give an elementary proof of a conjecture by Hegselmann and Krause in opinion dynamics, concerning a symmetric bounded confidence interval model: If there is a truth and all individuals take each other seriously by a positive amount bounded away fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b81d0a0cfe16497ed904a213896d78e
A fashion discounter supplies its branches with apparel in various sizes. Apparel is ordered in pre-packs three months in advance from overseas: replenishment impossible. Thus, the supply in each size and branch must be consistent with the demand rig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed37316dc477451a1ddf7fdeea7303f3
Publikováno v:
Theoretical Computer Science, 407(1-3), 231-241
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::cfd900525fff3e4c1f5a640757243b7a
https://ir.cwi.nl/pub/13627
https://ir.cwi.nl/pub/13627
Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a specific resource to the request) must be made immediately, while in a second st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______645::b9abe678e95d2d21b5762203b290becd
http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:b02dd819-f08f-434d-ac90-6073e7ab017f/datastreams/ASSET1/content
http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:b02dd819-f08f-434d-ac90-6073e7ab017f/datastreams/ASSET1/content
Autor:
Krumke, S.O., Lipmann, M., de Paepe, W.E., Poensgen, D., Rambau, J., Stougie, L., Woeginger, G.J.
Publikováno v:
Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), 263-264
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002)
Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002), 263-264
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002)
Krumke, S O, Lipmann, M, de Paepe, W E, Poensgen, D, Rambau, J, Stougie, L & Woeginger, G J 2002, How to cut a cake almost fairly . in Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) . Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 263-264, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 1/01/02 . < http://portal.acm.org/citation.cfm?id=545415 >
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002)
Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002), 263-264
STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002)
Krumke, S O, Lipmann, M, de Paepe, W E, Poensgen, D, Rambau, J, Stougie, L & Woeginger, G J 2002, How to cut a cake almost fairly . in Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) . Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 263-264, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 1/01/02 . < http://portal.acm.org/citation.cfm?id=545415 >
In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a "fair" share of the cake by his own measure. We describe a protocol with n - 1 cuts in which each player can enforce to get a share of at least 1/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::146a9cb29b86a967d808d8dd6d2d762e
https://research.utwente.nl/en/publications/2634aa5d-3a21-4276-9bb1-8f4f7c69736a
https://research.utwente.nl/en/publications/2634aa5d-3a21-4276-9bb1-8f4f7c69736a