default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Perregaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j9]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. Optim. Methods Softw. 33(3): 518-529 (2018)- 2017
- [c4]Timo Berthold, Michael Perregaard, Csaba Mészáros:
Four Good Reasons to Use an Interior Point Solver Within a MIP Solver. OR 2017: 159-164 - 2016
- [c3]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. ICMS 2016: 251-258
2000 – 2009
- 2009
- [j8]Richard Laundy, Michael Perregaard, Gabriel Tavares, Horia Tipi, Alkis Vazacopoulos:
Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study. INFORMS J. Comput. 21(2): 304-313 (2009) - 2003
- [j7]Egon Balas, Michael Perregaard:
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Math. Program. 94(2-3): 221-245 (2003) - 2002
- [j6]Egon Balas, Michael Perregaard:
Lift-and-project for Mixed 0-1 programming: recent progress. Discret. Appl. Math. 123(1-3): 129-154 (2002) - 2001
- [c2]Michael Perregaard, Egon Balas:
Generating Cuts from Multiple-Term Disjunctions. IPCO 2001: 348-360
1990 – 1999
- 1999
- [j5]Jens Clausen, Michael Perregaard:
On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. Ann. Oper. Res. 90: 1-17 (1999) - 1998
- [j4]Michael Perregaard, Jens Clausen:
Parallel branch-and-bound methods for thejob-shop scheduling problem. Ann. Oper. Res. 83: 137-160 (1998) - [j3]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) - [j2]Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard:
Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM. J. Parallel Distributed Comput. 50(1/2): 157-169 (1998) - 1997
- [j1]Jens Clausen, Michael Perregaard:
Solving Large Quadratic Assignment Problems in Parallel. Comput. Optim. Appl. 8(2): 111-127 (1997) - [c1]Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard:
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel. IPPS 1997: 418-
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:07 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:
