Zobrazeno 1 - 10
of 103
pro vyhledávání: '"R Pulleyblank"'
Publikováno v:
Value in Health. 25:S328-S329
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a4b88fb027006e538323effa9cbf3c8
https://doi.org/10.1016/j.jval.2022.09.1625
https://doi.org/10.1016/j.jval.2022.09.1625
Publikováno v:
Value in Health. 23:S408-S409
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab2b87d057b8eda18cfc8d6c37dfe51e
https://doi.org/10.1016/j.jval.2020.08.068
https://doi.org/10.1016/j.jval.2020.08.068
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.
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.
Autor:
Denis Naddef, Thomas M. Liebling, Giovanni Rinaldi, Laurence A. Wolsey, Michael Jünger, Gerhard Reinelt, William R. Pulleyblank
Publikováno v:
Mathematical Programming. 124:1-6
Reference EPFL-ARTICLE-172511doi:10.1007/s10107-010-0369-3View record in Web of Science Record created on 2011-12-16, modified on 2016-08-09
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9edc75af92b5c1201358b29a57be4c77
https://doi.org/10.1007/s10107-010-0369-3
https://doi.org/10.1007/s10107-010-0369-3
Publikováno v:
Mathematical Programming. 94:343-359
We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem cont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b6e6b22ee920b0f1c15047032ac370a
https://doi.org/10.1007/s10107-002-0323-0
https://doi.org/10.1007/s10107-002-0323-0
Autor:
W. R. Pulleyblank
Publikováno v:
IBM Journal of Research and Development. 47:89-96
In the last decade of the twentieth century, we saw great progress in the mathematical sciences as well as changes in the activities of the mathematical scientist. These included the resolution of some well-known conjectures, the introduction of new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c548e158999b5855db77544d92a59c1
https://doi.org/10.1147/rd.471.0089
https://doi.org/10.1147/rd.471.0089
Publikováno v:
Theoretical Computer Science. 287:563-570
We reexamine the class of (0, ±1) matrices called submodular, which we introduced in (Ann. Discrete Math. 15 (1982) 189). Our key idea in this paper is to define, for each submodular matrix M, a corresponding digraph G whose nodes are the columns of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6778873063c967a2ee7147363b506af
https://doi.org/10.1016/s0304-3975(01)00261-4
https://doi.org/10.1016/s0304-3975(01)00261-4
Publikováno v:
Journal of Quantitative Analysis in Sports.
Sports leagues consist of conferences subdivided into divisions. Teams play a number of games within their divisions and fewer games against teams in different divisions and conferences. Usually, a league structure remains stable from one season to t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fea1288eee268fabe3d0b7ab38303809
https://doi.org/10.1515/jqas-2013-0070
https://doi.org/10.1515/jqas-2013-0070
Publikováno v:
Information Processing Letters. 66:171-174
We consider the problem of traveling the contour of the set of all points that are within distance 1 of a connected planar curve arrangement P, forming an embedding of the graph G. We show that if the overall length of P is L, there is a closed round
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8835b4a9efbc7cab344be3919407d897
https://doi.org/10.1016/s0020-0190(98)00053-2
https://doi.org/10.1016/s0020-0190(98)00053-2