Michael Stiglmayr

Orcid: 0000-0003-0926-1584

According to our database1, Michael Stiglmayr authored at least 34 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A tight formulation for the dial-a-ride problem.
Eur. J. Oper. Res., 2025

2024
Augmenting bi-objective branch and bound by scalarization-based information.
Math. Methods Oper. Res., August, 2024

Special issue on exact and approximation methods for mixed-integer multi-objective optimization.
Math. Methods Oper. Res., August, 2024

Consensus-based optimization for multi-objective problems: a multi-swarm approach.
J. Glob. Optim., July, 2024

Efficient dominance filtering for unions and Minkowski sums of non-dominated sets.
Comput. Oper. Res., March, 2024

The Line-Based Dial-a-Ride Problem.
Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023
Ordinal optimization through multi-objective reformulation.
Eur. J. Oper. Res., December, 2023

Multi-objective matroid optimization with ordinal weights.
Discret. Appl. Math., August, 2023

Multiobjective Optimization on a Budget (Dagstuhl Seminar 23361).
Dagstuhl Reports, 2023

Adaptive Improvements of Multi-Objective Branch and Bound.
CoRR, 2023

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems.
CoRR, 2023

On the online path extension problem - Location and routing problems in board games.
CoRR, 2023

Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems.
CoRR, 2023

Ridepooling and public bus services: A comparative case-study.
CoRR, 2023

2022
Event-based MILP models for ridepooling applications.
Eur. J. Oper. Res., 2022

Efficient and sparse neural networks by pruning weights in a multiobjective learning approach.
Comput. Oper. Res., 2022

Computing representations using hypervolume scalarizations.
Comput. Oper. Res., 2022

Decision space robustness for multi-objective integer linear programming.
Ann. Oper. Res., 2022

2021
A local analysis to determine all optimal solutions of p-k-max location problems on networks.
Discret. Appl. Math., 2021

Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem.
Math. Methods Oper. Res., 2020

Introducing multiobjective complex systems.
Eur. J. Oper. Res., 2020

Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach.
CoRR, 2020

GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks.
CoRR, 2020

2019
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions.
J. Glob. Optim., 2019

Exact algorithms for handling outliers in center location problems on networks using <i>k</i>-max functions.
Eur. J. Oper. Res., 2019

Layout Problems with Reachability Constraint.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Assigning Students to Schools for an Internship.
Proceedings of the Operations Research Proceedings 2018, 2018

2015
Representation of the non-dominated set in biobjective discrete optimization.
Comput. Oper. Res., 2015

2014
On the multicriteria allocation problem.
Ann. Oper. Res., 2014

2012
Discrete and geometric Branch and Bound algorithms for medical image registration.
Ann. Oper. Res., 2012

2009
On the Application of the Monge--Kantorovich Problem to Image Registration.
SIAM J. Imaging Sci., 2009

2008
Registration of PE segment contour deformations in digital high-speed videos.
Medical Image Anal., 2008

A Branch & Bound Algorithm for Medical Image Registration.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008


  Loading...