Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Jakob Krarup"'
Autor:
Jakob Krarup, Cathal M. Brugha
Publikováno v:
Central European Journal of Operations Research. 27:275-281
On the eve of World War II and during the war itself a new science was born: operational research (OR) today recognised as the science of decision-making. New ideas were fostered and afterwards implemented in everyday life by a new generation of scie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a66bdc23af09f19b9f211a88532993d5
https://doi.org/10.1007/s10100-017-0498-3
https://doi.org/10.1007/s10100-017-0498-3
Autor:
Jakob Krarup
Publikováno v:
Central European Journal of Operations Research. 24:787-795
Born in 1936 I was a schoolboy on the threshold of the secondary school when a knapsack-type game was played with a class mate around 1946–1947. To play the game well and fascinated by numbers in general since my early childhood, however, I realize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ab95210be22feb002b0385a695c0fff
https://doi.org/10.1007/s10100-015-0404-9
https://doi.org/10.1007/s10100-015-0404-9
Autor:
Jakob Krarup, Sarah Fores
Publikováno v:
Central European Journal of Operations Research. 21:265-275
Operational Research (OR) is the science of decision-making. From its military origins on the eve of World War II, OR has over the past seven decades matured to become a discipline that is recognised worldwide for its contributions to managerial plan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d689ef144002a7914e23b2865547a79
https://doi.org/10.1007/s10100-012-0278-z
https://doi.org/10.1007/s10100-012-0278-z
Autor:
Jakob Krarup
Publikováno v:
Annals of Operations Research. 149:137-145
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1446aae87f3e74fd54b357530c7ed624
https://doi.org/10.1007/s10479-006-0099-3
https://doi.org/10.1007/s10479-006-0099-3
Autor:
Jakob Krarup, Malene Nordlund Rørbech
Publikováno v:
4OR. 2:259-274
Based on a pair of primal-dual LP formulations of the shortest path tree problem, the first algorithmic approach to reoptimizing the shortest paths subject to changes in the edge weights was proposed by S. Pallottino and M.G. Scutella in 2003. We sha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::318417275f278c58f5fada7159bee323
https://doi.org/10.1007/s10288-004-0048-4
https://doi.org/10.1007/s10288-004-0048-4
Autor:
Graham K. Rand, Jakob Krarup
Publikováno v:
European Journal of Operational Research. 252:699-700
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a030f295de33a68b806504366c3b36f5
https://doi.org/10.1016/j.ejor.2016.01.035
https://doi.org/10.1016/j.ejor.2016.01.035
Autor:
Michael Folkmann, Jakob Krarup, Paul H. Williams, Thomas M. Brooks, Joslin L. Moore, Carsten Rahbek, Neil Burgess, Andrew Balmford
Publikováno v:
Ecography. 26:595-601
Area-selection methods have recently gained prominence in conservation biology. A typical problem is to identify the minimum number of areas required to represent all species over some geographic region. Iterative heuristic methods have been develope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6c51b2f561ae01900fbfa87c35f9c6e
https://doi.org/10.1034/j.1600-0587.2003.03467.x
https://doi.org/10.1034/j.1600-0587.2003.03467.x
Autor:
Jakob Krarup, Galina Jalal
Publikováno v:
Annals of Operations Research. 123:67-104
The prime motivation for the present study is a famous problem, allegedly first formulated in 1643 by Fermat, and the so-called Complementary Problem (CP), proposed but incorrectly solved in 1941 by Courant and Robbins. For a given triangle, Fermat a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9523a1bd22e4af055278f809672f585
https://doi.org/10.1023/a:1026167011686
https://doi.org/10.1023/a:1026167011686
Autor:
Jakob Krarup, Peter M. Hahn
Publikováno v:
Journal of Intelligent Manufacturing. 12:487-496
This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans–Beckmann variant of the quadratic assignment problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem aros
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35267ddaa5ea2aa4c9ea0e80682edb08
https://doi.org/10.1023/a:1012252420779
https://doi.org/10.1023/a:1012252420779
Autor:
Jakob Krarup, R. E. Burkhard
Publikováno v:
Computing. 60:193-215
The 1-median problem on a network asks for a vertex minimizing the sum of the weighted shortest path distances from itself to all other vertices, each associated with a certain positive weight. We allow fornegative weights as well and devise an exact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b017ce365b8b24be7f0aa286d4df3e5
https://doi.org/10.1007/bf02684332
https://doi.org/10.1007/bf02684332