default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Raith
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Yasith Udagedara, Andrea Raith, Oliver Sinnen:
State-Space Search to Find Energy-Aware Pareto-Efficient Optimal Task Schedules. IPDPS (Workshops) 2024: 964-973- [i1]Thomas Dengiz, Andrea Raith, Max Kleinebrahm
, Jonathan Vogl, Wolf Fichtner:
Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehicles. CoRR abs/2407.11719 (2024) - 2023
- [j21]Russell Stewart, Andrea Raith, Oliver Sinnen:
Optimising makespan and energy consumption in task scheduling for parallel systems. Comput. Oper. Res. 154: 106212 (2023) - 2022
- [j20]Guillermo Cabrera-Guerrero, Matthias Ehrgott, Andrew J. Mason, Andrea Raith:
Bi-objective optimisation over a set of convex sub-problems. Ann. Oper. Res. 319(2): 1507-1532 (2022) - [j19]Andrea Raith, Matthias Ehrgott, Fariza Fauzi, Kuan-Min Lin, Andrew Macann, Paul Rouse, John Simpson:
Integrating Data Envelopment Analysis into radiotherapy treatment planning for head and neck cancer patients. Eur. J. Oper. Res. 296(1): 289-303 (2022) - [j18]Samuel Ridler, Andrew J. Mason, Andrea Raith:
A simulation and optimisation package for emergency medical services. Eur. J. Oper. Res. 298(3): 1101-1113 (2022) - 2021
- [j17]Sophia Boesen, Andrea Raith, Clemens Thielen, James Tidswell:
Enforcing fuel-optimal traffic patterns. EURO J. Transp. Logist. 10: 100060 (2021) - 2020
- [j16]Caroline J. Jagtenberg, Oliver J. Maclaren, Andrew J. Mason, Andrea Raith, Kevin Shen, Michael Sundvick:
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019. Networks 76(2): 273-293 (2020)
2010 – 2019
- 2019
- [c2]Melanie Reuter-Oppermann, Stefan Morana, Andrea Raith, Susan Sherer:
Introduction to the Minitrack on Optimization of and the Use of IT for Healthcare Processes. HICSS 2019: 1 - 2018
- [j15]Andrea Raith, Marie Schmidt, Anita Schöbel, Lisa Thom:
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty. Eur. J. Oper. Res. 267(2): 628-642 (2018) - [j14]Olga Perederieieva, Andrea Raith, Marie Schmidt:
Non-additive shortest path in the context of traffic assignment. Eur. J. Oper. Res. 268(1): 325-338 (2018) - [j13]Guillermo Cabrera-Guerrero, Andrew J. Mason, Andrea Raith, Matthias Ehrgott:
Pareto local search algorithms for the multi-objective beam angle optimisation problem. J. Heuristics 24(2): 205-238 (2018) - [j12]Guillermo Cabrera-Guerrero, Matthias Ehrgott, Andrew J. Mason, Andrea Raith:
A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity-modulated radiation therapy. Int. Trans. Oper. Res. 25(1): 243-268 (2018) - [j11]Andrea Raith, Marie Schmidt, Anita Schöbel, Lisa Thom:
Extensions of labeling algorithms for multi-objective uncertain shortest path problems. Networks 72(1): 84-127 (2018) - 2017
- [j10]Kuan-Min Lin, Matthias Ehrgott, Andrea Raith:
Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes. 4OR 15(4): 331-357 (2017) - [j9]Andrea Raith, Antonio Sedeño-Noda:
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach. Comput. Oper. Res. 82: 153-166 (2017) - 2016
- [j8]Kenneth D. Kuhn, Andrea Raith, Marie Schmidt, Anita Schöbel:
Bi-objective robust optimisation. Eur. J. Oper. Res. 252(2): 418-431 (2016) - [j7]Olga Perederieieva, Matthias Ehrgott, Andrea Raith, Judith Y. T. Wang:
Numerical stability of path-based algorithms for traffic assignment. Optim. Methods Softw. 31(1): 53-67 (2016) - 2015
- [j6]Olga Perederieieva, Matthias Ehrgott, Andrea Raith, Judith Y. T. Wang:
A framework for and empirical study of algorithms for traffic assignment. Comput. Oper. Res. 54: 90-107 (2015) - [j5]Antonio Sedeño-Noda, Andrea Raith:
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57: 83-94 (2015) - [j4]Siamak Moradi, Andrea Raith, Matthias Ehrgott:
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem. Eur. J. Oper. Res. 244(2): 369-378 (2015) - 2014
- [j3]Andrea Raith, Judith Y. T. Wang, Matthias Ehrgott, Stuart A. Mitchell:
Solving multi-objective traffic assignment. Ann. Oper. Res. 222(1): 483-516 (2014)
2000 – 2009
- 2009
- [j2]Andrea Raith, Matthias Ehrgott:
A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4): 1299-1331 (2009) - [j1]Andrea Raith, Matthias Ehrgott:
A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36(6): 1945-1954 (2009) - 2008
- [c1]Judith Y. T. Wang, Andrea Raith, Matthias Ehrgott:
Tolling Analysis with Bi-objective Traffic Assignment. MCDM 2008: 117-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
