default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakob Krarup
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j19]Cathal MacSwiney Brugha
, Jakob Krarup:
Jean-Pierre Brans: portrait of a fiery soul. Central Eur. J. Oper. Res. 27(1): 275-281 (2019)- 2016
- [j18]Jakob Krarup:
On the intriguing number 1001. Central Eur. J. Oper. Res. 24(3): 787-795 (2016) - [j17]Jakob Krarup, Graham K. Rand:
Maurice F. Shutler (1931-2015). Eur. J. Oper. Res. 252(3): 699-700 (2016) - 2013
- [j16]Sarah Fores, Jakob Krarup:
On the origins of OR and its institutions. Central Eur. J. Oper. Res. 21(2): 265-275 (2013) - 2007
- [j15]Jakob Krarup:
Dual ascent: variations of a theme. Ann. Oper. Res. 149(1): 137-145 (2007) - 2006
- [j14]Leonidas Sakalauskas, Jakob Krarup:
Heuristic and stochastic methods in optimization. Eur. J. Oper. Res. 171(3): 723-724 (2006) - 2004
- [j13]Jakob Krarup, Malene Nordlund Rørbech:
LP formulations of the shortest path tree problem. 4OR 2(4): 259-274 (2004) - 2003
- [j12]Galina Jalal, Jakob Krarup:
Geometrical Solution to the Fermat Problem with Arbitrary Weights. Ann. Oper. Res. 123(1-4): 67-104 (2003) - 2002
- [j11]Jakob Krarup, David Pisinger, Frank Plastria:
Discrete location problems with push-pull objectives. Discret. Appl. Math. 123(1-3): 363-378 (2002) - [j10]Jakob Krarup:
Prologue: EURO 2000. Eur. J. Oper. Res. 140(2): 165-166 (2002) - [j9]Jakob Krarup, David Pisinger:
The EURO 2000 feature issue of EJOR. Eur. J. Oper. Res. 140(2): 167-169 (2002) - 2001
- [j8]Peter M. Hahn, Jakob Krarup:
A hospital facility layout problem finally solved. J. Intell. Manuf. 12(5-6): 487-496 (2001) - 2000
- [j7]Jakob Krarup, David Pisinger:
Editorial. Eur. J. Oper. Res. 125(2): 219-221 (2000) - 1998
- [j6]Rainer E. Burkard, Jakob Krarup:
A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus. Computing 60(3): 193-216 (1998) - 1995
- [j5]Jens Clausen, Jakob Krarup:
A Family of Bipartite Cardinality Matching Problems Solvable in O(n2) Time. Nord. J. Comput. 2(4): 496-501 (1995) - 1988
- [j4]Jens Clausen, Jakob Krarup:
Arranging Apples in an Array. BIT 28(3): 552-568 (1988) - 1986
- [j3]Jakob Krarup, Peter M. Pruzan:
Assessment of Approximate Algorithms: The Error Measure's Crucial Role. BIT 26(3): 284-294 (1986) - 1981
- [j2]Rainer E. Burkard, Hans Keiding, Peter M. Pruzan, Jakob Krarup:
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems. Comput. Oper. Res. 8(4): 241-247 (1981) - 1974
- [j1]Keld Helbig Hansen, Jakob Krarup:
Improvements of the Held - Karp algorithm for the symmetric traveling-salesman problem. Math. Program. 7(1): 87-96 (1974)
Reference Works
- 2009
- [r1]Jakob Krarup:
Warehouse Location Problem. Encyclopedia of Optimization 2009: 4050-4055
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
