The following pages link to Andrea Raith (Q319359):
Displaying 19 items.
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Bi-objective robust optimisation (Q322907) (← links)
- A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- Solving multi-objective traffic assignment (Q490239) (← links)
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes (Q681288) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- A simulation and optimisation package for emergency medical services (Q2076894) (← links)
- Bi-objective optimisation over a set of convex sub-problems (Q2108798) (← links)
- Numerical stability of path-based algorithms for traffic assignment (Q2811480) (← links)
- Tolling Analysis with Bi-objective Traffic Assignment (Q3556547) (← links)
- A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy (Q4608257) (← links)
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
- Optimising makespan and energy consumption in task scheduling for parallel systems (Q6164588) (← links)
