Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaximilian Merkert
Person information
- affiliation: Technische Universität Braunschweig, Braunschweig, Germany
- affiliation (former): Otto von Guericke University Magdeburg, Germany
- affiliation (former): Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
- affiliation (former): TU Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Andreas Bärmann
, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez:
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. Discret. Appl. Math. 324: 145-166 (2023)- 2022
- [j8]Maximilian Merkert, Galina Orlinskaya, Dieter Weninger:
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities. J. Glob. Optim. 84(3): 607-650 (2022) - [j7]Andreas Bärmann, Patrick Gemander, Alexander Martin, Maximilian Merkert:
On Recognizing Staircase Compatibility. J. Optim. Theory Appl. 195(2): 449-479 (2022) - [j6]Do Duc Le, Maximilian Merkert, Stephan Sorgatz, Mirko Hahn, Sebastian Sager:
Autonomous traffic at intersections: An optimization-based analysis of possible time, energy, and CO savings. Networks 79(3): 338-363 (2022) - 2021
- [j5]Frauke Liers, Alexander Martin, Maximilian Merkert, Nick Mertens, Dennis Michaels:
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80(2): 307-340 (2021) - 2020
- [j4]Andreas Bärmann, Patrick Gemander, Maximilian Merkert:
The clique problem with multiple-choice constraints under a cycle-free dependency graph. Discret. Appl. Math. 283: 59-77 (2020)
2010 – 2019
- 2018
- [j3]Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider:
Staircase compatibility and its applications in scheduling and piecewise linearization. Discret. Optim. 29: 111-132 (2018) - 2016
- [j2]Frauke Liers, Maximilian Merkert:
Structural Investigation of Piecewise Linearized Network Flow Problems. SIAM J. Optim. 26(4): 2863-2886 (2016) - 2015
- [j1]Andreas Bärmann, Frauke Liers, Alexander Martin, Maximilian Merkert, Christoph Thurner, Dieter Weninger:
Solving network design problems via iterative aggregation. Math. Program. Comput. 7(2): 189-217 (2015) - 2012
- [c1]Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert:
Approximating Infeasible 2VPI-Systems. WG 2012: 225-236
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 2023-09-27 22:54 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:
