default search action
Michael Stiglmayr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j21]Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Michael Stiglmayr, Arne Schulz:
A tight formulation for the dial-a-ride problem. Eur. J. Oper. Res. 321(2): 363-382 (2025) - 2024
- [j20]Kathrin Klamroth
, Bruno Lang
Efficient dominance filtering for unions and Minkowski sums of non-dominated sets. Comput. Oper. Res. 163: 106506 (2024) - [j19]Kathrin Klamroth
Consensus-based optimization for multi-objective problems: a multi-swarm approach. J. Glob. Optim. 89(3): 745-776 (2024) - [j18]Carlos Henggeler Antunes, Carlos M. Fonseca, Luís Paquete, Michael Stiglmayr:
Special issue on exact and approximation methods for mixed-integer multi-objective optimization. Math. Methods Oper. Res. 100(1): 1-4 (2024) - [j17]Julius Bauß
Augmenting bi-objective branch and bound by scalarization-based information. Math. Methods Oper. Res. 100(1): 85-121 (2024) - [c5]Kendra Reiter, Marie Schmidt, Michael Stiglmayr:
The Line-Based Dial-a-Ride Problem. ATMOS 2024: 14:1-14:20 - 2023
- [j16]Kathrin Klamroth
Multi-objective matroid optimization with ordinal weights. Discret. Appl. Math. 335: 104-119 (2023) - [j15]Kathrin Klamroth
Ordinal optimization through multi-objective reformulation. Eur. J. Oper. Res. 311(2): 427-443 (2023) - [i9]Hayk Asatryan, Daniela Gaul, Hanno Gottschalk, Kathrin Klamroth, Michael Stiglmayr:
Ridepooling and public bus services: A comparative case-study. CoRR abs/2302.01709 (2023) - [i8]Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang, Michael Stiglmayr, Claudia Totzeck:
Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems. CoRR abs/2303.15082 (2023) - [i7]Konstantin Kraus, Kathrin Klamroth, Michael Stiglmayr:
On the online path extension problem - Location and routing problems in board games. CoRR abs/2305.12898 (2023) - [i6]Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Arne Schulz
A Tight Formulation for the Dial-a-Ride Problem. CoRR abs/2308.11285 (2023) - [i5]David Könen, Michael Stiglmayr:
Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems. CoRR abs/2312.01786 (2023) - [i4]Julius Bauß, Sophie N. Parragh, Michael Stiglmayr:
Adaptive Improvements of Multi-Objective Branch and Bound. CoRR abs/2312.12192 (2023) - [i3]Richard Allmendinger, Carlos M. Fonseca, Serpil Sayin, Margaret M. Wiecek, Michael Stiglmayr:
Multiobjective Optimization on a Budget (Dagstuhl Seminar 23361). Dagstuhl Reports 13(9): 1-68 (2023) - 2022
- [j14]Michael Stiglmayr
Decision space robustness for multi-objective integer linear programming. Ann. Oper. Res. 319(2): 1769-1791 (2022) - [j13]Luís Paquete
Computing representations using hypervolume scalarizations. Comput. Oper. Res. 137: 105349 (2022) - [j12]Malena Reiners, Kathrin Klamroth
Efficient and sparse neural networks by pruning weights in a multiobjective learning approach. Comput. Oper. Res. 141: 105676 (2022) - [j11]Daniela Gaul
Event-based MILP models for ridepooling applications. Eur. J. Oper. Res. 301(3): 1048-1063 (2022) - 2021
- [j10]Teresa Schnepper, Kathrin Klamroth
A local analysis to determine all optimal solutions of p-k-max location problems on networks. Discret. Appl. Math. 296: 217-234 (2021) - [c4]Daniela Gaul
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. ATMOS 2021: 8:1-8:16 - 2020
- [j9]Tobias Dietz, Kathrin Klamroth
Introducing multiobjective complex systems. Eur. J. Oper. Res. 280(2): 581-596 (2020) - [j8]Britta Schulze
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. Math. Methods Oper. Res. 92(1): 107-132 (2020) - [i2]Jan Backhaus, Matthias Bolten, Onur Tanil Doganay, Matthias Ehrhardt, Benedikt Engel, Christian Frey, Hanno Gottschalk, Michael Günther, Camilla Hahn, Jens Jäschke
GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks. CoRR abs/2002.08672 (2020) - [i1]Malena Reiners, Kathrin Klamroth, Michael Stiglmayr:
Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach. CoRR abs/2008.13590 (2020)
2010 – 2019
- 2019
- [j7]Teresa Schnepper, Kathrin Klamroth
Exact algorithms for handling outliers in center location problems on networks using k-max functions. Eur. J. Oper. Res. 273(2): 441-451 (2019) - [j6]Britta Schulze
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions. J. Glob. Optim. 74(3): 495-522 (2019) - [c3]Michael Stiglmayr:
Layout Problems with Reachability Constraint. OR 2019: 183-189 - 2018
- [c2]Michael Stiglmayr, Simon Görtz, Kathrin Klamroth
Assigning Students to Schools for an Internship. OR 2018: 151-157 - 2015
- [j5]Daniel Vaz
Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63: 172-186 (2015) - 2014
- [j4]Michael Stiglmayr
On the multicriteria allocation problem. Ann. Oper. Res. 222(1): 535-549 (2014) - 2012
- [j3]Frank Pfeuffer, Michael Stiglmayr
Discrete and geometric Branch and Bound algorithms for medical image registration. Ann. Oper. Res. 196(1): 737-765 (2012)
2000 – 2009
- 2009
- [j2]O. Museyko, Michael Stiglmayr
On the Application of the Monge--Kantorovich Problem to Image Registration. SIAM J. Imaging Sci. 2(4): 1068-1097 (2009) - 2008
- [j1]Michael Stiglmayr
Registration of PE segment contour deformations in digital high-speed videos. Medical Image Anal. 12(3): 318-334 (2008) - [c1]Michael Stiglmayr, Frank Pfeuffer, Kathrin Klamroth
A Branch & Bound Algorithm for Medical Image Registration. IWCIA 2008: 217-228
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-12-10 21:46 CET 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: