default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan E. Karisch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j11]Stefan E. Karisch, William J. Tarantino:
ASP, The Art and Science of Practice: From Edelman Award to INFORMS Prize - Jeppesen's 15-Year Journey Toward Analytics Excellence and Lessons Learned Along the Way. Interfaces 43(6): 554-565 (2013)- 2004
- [j10]Niklas Kohl, Stefan E. Karisch:
Airline Crew Rostering: Problem Types, Modeling, and Optimization. Ann. Oper. Res. 127(1-4): 223-257 (2004) - 2002
- [j9]Torsten Fahle, Ulrich Junker
, Stefan E. Karisch:
Preface. Ann. Oper. Res. 115(1-4): 13-14 (2002) - [j8]Torsten Fahle, Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Meinolf Sellmann, Bo Vaaben:
Constraint Programming Based Column Generation for Crew Assignment. J. Heuristics 8(1): 59-81 (2002) - 2000
- [j7]Stefan E. Karisch, Franz Rendl, Jens Clausen:
Solving Graph Bisection Problems with Semidefinite Programming. INFORMS J. Comput. 12(3): 177-191 (2000) - 1999
- [j6]Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen:
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. Computing 63(4): 351-403 (1999) - 1998
- [j5]Jens Clausen, Stefan E. Karisch, Michael Perregaard, Franz Rendl:
On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. 10(2): 127-147 (1998) - [j4]Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz:
Semidefinite Programming Relaxations for the Quadratic Assignment Problem. J. Comb. Optim. 2(1): 71-109 (1998) - 1997
- [j3]A. Gerstl, Stefan E. Karisch:
Cost optimization for the slitting of core laminations for power transformers. Ann. Oper. Res. 69: 157-169 (1997) - [j2]Rainer E. Burkard, Stefan E. Karisch, Franz Rendl:
QAPLIB - A Quadratic Assignment Problem Library. J. Glob. Optim. 10(4): 391-403 (1997) - 1995
- [j1]Stefan E. Karisch, Franz Rendl:
Lower bounds for the quadratic assignment problem via triangle decompositions. Math. Program. 71: 137-151 (1995)
Conference and Workshop Papers
- 1999
- [c2]Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann:
A Framework for Constraint Programming Based Column Generation. CP 1999: 261-274 - 1993
- [c1]Stefan E. Karisch, Franz Rendl, Henry Wolkowicz:
Trust Regions and Relaxations for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 199-219
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:11 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:
