The following pages link to Michael Stiglmayr (Q342057):
Displaying 25 items.
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
- Layout problems with reachability constraint (Q2050256) (← links)
- Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components (Q2139167) (← links)
- Event-based MILP models for ridepooling applications (Q2140290) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Gradient based biobjective shape optimization to improve reliability and cost of ceramic components (Q2218896) (← links)
- Introducing multiobjective complex systems (Q2273915) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approach (Q2669736) (← links)
- On the Application of the Monge–Kantorovich Problem to Image Registration (Q3649073) (← links)
- Multi-objective matroid optimization with ordinal weights (Q6046136) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach (Q6348082) (← links)
- Efficient dominance filtering for unions and Minkowski sums of non-dominated sets (Q6551105) (← links)
- Consensus-based optimization for multi-objective problems: a multi-swarm approach (Q6568955) (← links)
- Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph (Q6587283) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
- Determining cost-efficient controls of electrical energy storages using dynamic programming (Q6617838) (← links)
- The Line-Based Dial-a-Ride Problem (Q6744352) (← links)
