Michael Stiglmayr

Available identifiers

zbMath Open stiglmayr.michaelDBLP57/3844WikidataQ102377676 ScholiaQ102377676MaRDI QIDQ342057

List of research outcomes

Publication	Date of Publication	Type
Determining cost-efficient controls of electrical energy storages using dynamic programming	2024-10-11	Paper
Augmenting bi-objective branch and bound by scalarization-based information	2024-10-09	Paper
Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph	2024-08-13	Paper
Consensus-based optimization for multi-objective problems: a multi-swarm approach	2024-07-08	Paper
Efficient dominance filtering for unions and Minkowski sums of non-dominated sets	2024-06-06	Paper
A Multi-objective Perspective on the Cable-Trench Problem	2023-12-21	Paper
Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems	2023-12-04	Paper
Adapting Branching and Queuing for Multi-objective Branch and Bound	2023-11-10	Paper
Ordinal optimization through multi-objective reformulation	2023-09-15	Paper
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems	2023-05-22	Paper
Multi-objective matroid optimization with ordinal weights	2023-05-15	Paper
A new perspective on dynamic network flow problems via port-Hamiltonian systems	2023-03-27	Paper
Modeling Minimum Cost Network Flows With Port-Hamiltonian Systems	2023-03-23	Paper
Augmenting Bi-objective Branch and Bound by Scalarization-Based Information	2023-01-27	Paper
Decision space robustness for multi-objective integer linear programming	2022-12-20	Paper
Consensus-Based Optimization for Multi-Objective Problems: A Multi-Swarm Approach	2022-11-28	Paper
Determining Cost-Efficient Controls of Electrical Energy Storages Using Dynamic Programming	2022-09-12	Paper
Event-based MILP models for ridepooling applications	2022-05-20	Paper
Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components	2022-05-17	Paper
Efficient and sparse neural networks by pruning weights in a multiobjective learning approach	2022-03-09	Paper
Computing representations using hypervolume scalarizations	2022-03-09	Paper
Layout problems with reachability constraint	2021-08-30	Paper
A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks	2021-04-20	Paper
Gradient based biobjective shape optimization to improve reliability and cost of ceramic components	2021-01-18	Paper
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem	2020-12-15	Paper
Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach	2020-08-31	Paper
Introducing multiobjective complex systems	2019-09-18	Paper
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions	2019-06-20	Paper
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions	2018-11-19	Paper
Representation of the non-dominated set in biobjective discrete optimization	2016-11-17	Paper
On the multicriteria allocation problem	2015-01-22	Paper
Discrete and geometric branch and bound algorithms for~medical image registration	2012-11-15	Paper
On the application of the Monge-Kantorovich problem to image registration	2009-12-02	Paper

Research outcomes over time

This page was built for person: Michael Stiglmayr