Andrea Raith
Orcid: 0000-0002-0417-2972Affiliations:
- University of Auckland, New Zealand
According to our database1,
Andrea Raith
authored at least 25 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehicles.
CoRR, 2024
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024
2023
Comput. Oper. Res., June, 2023
2022
Eur. J. Oper. Res., 2022
Integrating Data Envelopment Analysis into radiotherapy treatment planning for head and neck cancer patients.
Eur. J. Oper. Res., 2022
2021
2020
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019.
Networks, 2020
2019
Introduction to the Minitrack on Optimization of and the Use of IT for Healthcare Processes.
Proceedings of the 52nd Hawaii International Conference on System Sciences, 2019
2018
Extensions of labeling algorithms for multi-objective uncertain shortest path problems.
Networks, 2018
A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy.
Int. Trans. Oper. Res., 2018
Pareto local search algorithms for the multi-objective beam angle optimisation problem.
J. Heuristics, 2018
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty.
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
2017
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach.
Comput. Oper. Res., 2017
Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes.
4OR, 2017
2016
Optim. Methods Softw., 2016
2015
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem.
Eur. J. Oper. Res., 2015
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem.
Comput. Oper. Res., 2015
Comput. Oper. Res., 2015
2014
2009
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
Proceedings of the Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, 2008