default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael R. Bussieck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Timo Lohmann, Michael R. Bussieck, Lutz Westermann, Steffen Rebennack
:
High-Performance Prototyping of Decomposition Methods in GAMS. INFORMS J. Comput. 33(1): 34-50 (2021)
2010 – 2019
- 2017
- [c2]Thomas Breuer, Michael R. Bussieck, Karl-Kiên Cao, Felix Cebulla, Frederik Fiand, Hans Christian Gils, Ambros M. Gleixner, Dmitry Khabi, Thorsten Koch, Daniel Rehfeldt, Manuel Wetzel:
Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods. OR 2017: 641-647 - 2014
- [j14]Michael R. Bussieck, Steven P. Dirkse, Stefan Vigerske:
PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2-3): 259-275 (2014) - 2012
- [j13]Aykut Ahlatçioglu, Michael R. Bussieck, Mustafa Esen, Monique Guignard, Jan-Hendrick Jagla, Alexander Meeraus:
Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints. Ann. Oper. Res. 199(1): 33-49 (2012) - 2010
- [j12]Siqun Wang, Michael R. Bussieck, Monique Guignard, Alexander Meeraus, Fred O'Brien:
Term-end exam scheduling at United States Military Academy/West Point. J. Sched. 13(4): 375-391 (2010)
2000 – 2009
- 2009
- [j11]Michael R. Bussieck, Michael C. Ferris, Alexander Meeraus:
Grid-Enabled Optimization with GAMS. INFORMS J. Comput. 21(3): 349-362 (2009) - [j10]Zsolt Ugray, Leon S. Lasdon, John C. Plummer, Michael R. Bussieck:
Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP. Optim. Methods Softw. 24(4-5): 635-656 (2009) - 2007
- [j9]Michael R. Bussieck, Alexander Meeraus:
Algebraic modeling for IP and MIP (GAMS). Ann. Oper. Res. 149(1): 49-56 (2007) - 2004
- [j8]Srinivas Bollapragada, Michael R. Bussieck, Suman Mallik:
Scheduling Commercial Videotapes in Broadcast Television. Oper. Res. 52(5): 679-689 (2004) - [j7]Michael R. Bussieck, Thomas Lindner, Marco E. Lübbecke:
A fast algorithm for near cost optimal line plans. Math. Methods Oper. Res. 59(2): 205-220 (2004) - 2003
- [j6]Michael R. Bussieck, Arne Stolbjerg Drud, Alexander Meeraus:
MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming. INFORMS J. Comput. 15(1): 114-119 (2003) - 2002
- [c1]Michael R. Bussieck, Arne Stolbjerg Drud, Alexander Meeraus, Armin Pruessner:
Quality Assurance and Global Optimization. COCOS 2002: 223-238
1990 – 1999
- 1999
- [j5]Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter:
Scheduling trams in the morning. Math. Methods Oper. Res. 49(1): 137-148 (1999) - 1998
- [b1]Michael R. Bussieck:
Optimal Lines in Public Rail Transport. Braunschweig University of Technology, Germany, 1998 - [j4]Michael R. Bussieck, Marco E. Lübbecke:
The vertex set of a 0/1-polytope is strongly P-enumerable. Comput. Geom. 11(2): 103-109 (1998) - 1997
- [j3]Michael R. Bussieck, Thomas Winter, Uwe T. Zimmermann:
Discrete optimization in public rail transport. Math. Program. 79: 415-444 (1997) - 1996
- [j2]Michael R. Bussieck:
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks. Math. Methods Oper. Res. 43(2): 183-194 (1996) - 1994
- [j1]Michael R. Bussieck, Hannes Hassler, Gerhard J. Woeginger, Uwe T. Zimmermann:
Fast algorithms for the maximum convolution problem. Oper. Res. Lett. 15(3): 133-141 (1994)
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-10-16 21:23 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:
