default search action
Andreas T. Ernst
Person information
- affiliation: Monash University, School of Mathematical Sciences, Clayton, VIC, Australia
- affiliation (former): CSIRO, Clayton, VIC, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j68]Yuan Sun
, Samuel Esler, Dhananjay R. Thiruvady
Instance space analysis for the car sequencing problem. Ann. Oper. Res. 341(1): 41-69 (2024) - [j67]Jeffrey Christiansen, Andreas T. Ernst
A robust optimization approach for a two-player force-design game. Eur. J. Oper. Res. 318(2): 656-669 (2024) - [j66]Yuan Sun
Enhancing constraint programming via supervised learning for job shop scheduling. Knowl. Based Syst. 293: 111698 (2024) - 2023
- [j65]Mobina Mashkani, Andreas T. Ernst, Dhananjay R. Thiruvady
Minimizing patients total clinical condition deterioration in operating theatre departments. Ann. Oper. Res. 328(1): 821-857 (2023) - [j64]Jake Weiner, Andreas T. Ernst
Ranking constraint relaxations for mixed integer programs using a machine learning approach. EURO J. Comput. Optim. 11: 100061 (2023) - [j63]Yunzhuang Shen
Adaptive solution prediction for combinatorial optimization. Eur. J. Oper. Res. 309(3): 1392-1408 (2023) - [j62]Andreas T. Ernst, Lars Grüne, Janosch Rieger
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems. J. Glob. Optim. 86(2): 521-543 (2023) - [c33]Yuan Sun, Andreas T. Ernst, Xiaodong Li, Jake Weiner:
Learning to Generate Columns with Application to Vertex Coloring. ICLR 2023 - 2022
- [j61]Atabak Elmi
Blocking Cyclic Job-Shop Scheduling Problems. Algorithms 15(10): 375 (2022) - [j60]Yuan Sun
Boosting ant colony optimization via solution prediction and machine learning. Comput. Oper. Res. 143: 105769 (2022) - [j59]Andrew Perrykkad
A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem. Oper. Res. 70(3): 1531-1559 (2022) - [c32]Yunzhuang Shen, Yuan Sun, Xiaodong Li, Andrew C. Eberhard, Andreas T. Ernst:
Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring. AAAI 2022: 9926-9934 - [i8]Dhananjay R. Thiruvady
An Efficient Merge Search Matheuristic for Maximising the Net Present Value of Project Schedules. CoRR abs/2210.11260 (2022) - [i7]Yuan Sun, Su Nguyen
Enhancing Constraint Programming via Supervised Learning for Job Shop Scheduling. CoRR abs/2211.14492 (2022) - 2021
- [j58]Ahmad Kazemi
New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem. Comput. Oper. Res. 136: 105505 (2021) - [j57]Jake Weiner, Andreas T. Ernst, Xiaodong Li
Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid. Eur. J. Oper. Res. 293(3): 847-862 (2021) - [j56]Ahmad Kazemi
Locomotive fuel management with inline refueling. Eur. J. Oper. Res. 293(3): 1077-1096 (2021) - [j55]Steven J. Edwards, Davaatseren Baatar, Kate Smith-Miles, Andreas T. Ernst:
Symmetry breaking of identical projects in the high-multiplicity RCPSP/max. J. Oper. Res. Soc. 72(8): 1822-1843 (2021) - [j54]Yuan Sun
Generalization of machine learning for problem reduction: a case study on travelling salesman problems. OR Spectr. 43(3): 607-633 (2021) - [j53]Yuan Sun
Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems. IEEE Trans. Pattern Anal. Mach. Intell. 43(5): 1746-1760 (2021) - [c31]Cameron A. G. MacRae, Melih Ozlen
The bee-benders hybrid algorithm with application to transmission expansion planning. GECCO Companion 2021: 1275-1282 - [i6]Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy:
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem. CoRR abs/2101.03707 (2021) - [i5]Yunzhuang Shen, Yuan Sun, Xiaodong Li, Andrew C. Eberhard, Andreas T. Ernst:
Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring. CoRR abs/2112.04906 (2021) - 2020
- [j52]Dhananjay R. Thiruvady
Solution Merging in Matheuristics for Resource Constrained Job Scheduling. Algorithms 13(10): 256 (2020) - [j51]Mohan Krishnamoorthy, Gaurav Singh, Andreas T. Ernst, Graham Kendall:
Editorial. Comput. Oper. Res. 115: 104885 (2020) - [j50]Dhananjay R. Thiruvady
Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing. Int. J. Prod. Res. 58(9): 2696-2711 (2020) - [c30]Jake Weiner, Andreas T. Ernst, Xiaodong Li, Yuan Sun
Automatic decomposition of mixed integer programs for lagrangian relaxation using a multiobjective approach. GECCO 2020: 263-270 - [c29]Mobina Mashkani, Hanyu Gu
Minimizing Total Clinical Deterioration in Operating Theatres. SSCI 2020: 2373-2380 - [i4]Yuan Sun, Andreas T. Ernst, Xiaodong Li, Jake Weiner:
Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems. CoRR abs/2005.05847 (2020) - [i3]Yuan Sun, Sheng Wang, Yunzhuang Shen, Xiaodong Li, Andreas T. Ernst, Michael Kirley:
Boosting Ant Colony Optimization via Solution Prediction and Machine Learning. CoRR abs/2008.04213 (2020) - [i2]Yuan Sun, Samuel Esler, Dhananjay R. Thiruvady, Andreas T. Ernst, Xiaodong Li, Kerri Morgan:
Instance Space Analysis for the Car Sequencing Problem. CoRR abs/2012.10053 (2020)
2010 – 2019
- 2019
- [j49]Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes
Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134: 37-51 (2019) - [j48]Hamid Mokhtar
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems. Comput. Oper. Res. 104: 375-393 (2019) - [j47]Hamid Mokhtar
An intermodal hub location problem for container distribution in Indonesia. Comput. Oper. Res. 104: 415-432 (2019) - [j46]Su Nguyen
A hybrid differential evolution algorithm with column generation for resource constrained job scheduling. Comput. Oper. Res. 109: 273-287 (2019) - [j45]Andreas T. Ernst, Joey Fung
Flexible flow shop with dedicated buffers. Discret. Appl. Math. 261: 148-163 (2019) - [j44]Claus-Henning Brech, Andreas T. Ernst
Scheduling medical residents' training at university hospitals. Eur. J. Oper. Res. 274(1): 253-266 (2019) - [j43]Himanshu Shrivastava, Andreas T. Ernst, Mohan Krishnamoorthy:
Distribution and Inventory Planning in a Supply Chain Under Transportation Route Disruptions and Uncertain Demands. Int. J. Inf. Syst. Supply Chain Manag. 12(3): 47-71 (2019) - [j42]Zühal Kartal, Mohan Krishnamoorthy, Andreas T. Ernst:
Heuristic algorithms for the single allocation p-hub center problem with routing considerations. OR Spectr. 41(1): 99-145 (2019) - [c28]Christian Blum
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence 2019: 549-560 - [c27]Yuan Sun, Xiaodong Li
Decomposition for Large-scale Optimization Problems with Overlapping Components. CEC 2019: 326-333 - [c26]Angus Kenny, Xiaodong Li
An improved merge search algorithm for the constrained pit problem in open-pit mining. GECCO 2019: 294-302 - [c25]Dhananjay R. Thiruvady
Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO. HM 2019: 16-30 - 2018
- [j41]Sarang Kulkarni
A new two-stage heuristic for the recreational vehicle scheduling problem. Comput. Oper. Res. 91: 59-78 (2018) - [j40]Jing Xie
A Bi-Level Optimization Model for Grouping Constrained Storage Location Assignment Problems. IEEE Trans. Cybern. 48(1): 385-398 (2018) - [c24]Angus Kenny, Xiaodong Li
A merge search algorithm and its application to the constrained pit problem in mining. GECCO 2018: 316-323 - [c23]Su Nguyen
Genetic programming approach to learning multi-pass heuristics for resource constrained job scheduling. GECCO 2018: 1167-1174 - [i1]Mateus Rocha de Paula, Natashia Boland, Andreas T. Ernst, Alexandre Mendes, Martin W. P. Savelsbergh:
Maximising Throughput in a Complex Coal Export System. CoRR abs/1808.06044 (2018) - 2017
- [j39]Niraj Ramesh Dayama, Andreas T. Ernst
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports. EURO J. Transp. Logist. 6(4): 307-348 (2017) - [j38]Andreas T. Ernst
Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20(5): 459-473 (2017) - [c22]Dror Cohen, Antonio Gómez-Iglesias
Resource Constrained Job Scheduling with Parallel Constraint-Based ACO. ACALCI 2017: 266-278 - [c21]Joe Bunton, Andreas T. Ernst, Mohan Krishnamoorthy
An Integer Programming based Ant Colony Optimisation Method for Nurse Rostering. FedCSIS 2017: 407-414 - [c20]Angus Kenny, Xiaodong Li, Andreas T. Ernst, Dhananjay R. Thiruvady:
Towards solving large-scale precedence constrained production scheduling problems in mining. GECCO 2017: 1137-1144 - [c19]Hamid Mokhtar, Mohan Krishnamoorthy, Andreas T. Ernst:
A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems. OR 2017: 135-141 - 2016
- [j37]Dhananjay R. Thiruvady
Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 242(2): 355-372 (2016) - [j36]Pieter Smet
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76: 60-72 (2016) - [c18]Angus Kenny, Xiaodong Li
A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs. GECCO 2016: 333-340 - 2015
- [j35]Luke R. Mason, Vicky H. Mak-Hau
A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning. Comput. Optim. Appl. 60(2): 441-477 (2015) - [j34]Niraj Ramesh Dayama, Mohan Krishnamoorthy
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence. Comput. Oper. Res. 64: 245-261 (2015) - [j33]Jeffery D. Connor
Modelling Australian land use competition and ecosystem services with food price feedbacks at high spatial resolution. Environ. Model. Softw. 69: 141-154 (2015) - [j32]Gaurav Singh
Rail schedule optimisation in the hunter valley coal chain. RAIRO Oper. Res. 49(2): 413-434 (2015) - [c17]Jing Xie, Yi Mei
A Restricted Neighbourhood Tabu Search for Storage Location Assignment Problem. CEC 2015: 2805-2812 - [c16]Davaatseren Baatar
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem. ESA 2015: 59-70 - [c15]Asef Nazari, Andreas T. Ernst, Simon Dunstall
Combined Aggregation and Column Generation for Land-Use Trade-Off Optimisation. ISESS 2015: 455-466 - 2014
- [j31]Mihiro Sasaki, James F. Campbell, Mohan Krishnamoorthy
A Stackelberg hub arc location model for a competitive environment. Comput. Oper. Res. 47: 27-41 (2014) - [j30]Niraj Ramesh Dayama, Mohan Krishnamoorthy
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Comput. Oper. Res. 52: 68-83 (2014) - [j29]Dhananjay R. Thiruvady
A Lagrangian-ACO matheuristic for car sequencing. EURO J. Comput. Optim. 2(4): 279-296 (2014) - [j28]Matthew Baxter, Tarek Elgindy
Incremental network design with shortest paths. Eur. J. Oper. Res. 238(3): 675-684 (2014) - [j27]Gaurav Singh
Medium-Term Rail Scheduling for an Iron Ore Mining Company. Interfaces 44(2): 222-240 (2014) - [c14]Jing Xie, Yi Mei
A genetic programming-based hyper-heuristic approach for storage location assignment problem. IEEE Congress on Evolutionary Computation 2014: 3000-3007 - [c13]Dhananjay R. Thiruvady
Hybrids of Integer Programming and ACO for Resource Constrained Job Scheduling. Hybrid Metaheuristics 2014: 130-144 - [c12]Jing Xie, Yi Mei
Scaling Up Solutions to Storage Location Assignment Problems by Genetic Programming. SEAL 2014: 691-702 - 2013
- [c11]Antonio Gómez-Iglesias
Scalable Multi Swarm-Based Algorithms with Lagrangian Relaxation for Constrained Problems. TrustCom/ISPA/IUCC 2013: 1073-1080 - 2012
- [j26]Mohan Krishnamoorthy
Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems. Eur. J. Oper. Res. 219(1): 34-48 (2012) - [j25]Gaurav Singh
A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain. Eur. J. Oper. Res. 220(1): 210-224 (2012) - [j24]Luke R. Mason, Vicky H. Mak-Hau
An exact method for minimizing the total treatment time in intensity-modulated radiotherapy. J. Oper. Res. Soc. 63(10): 1447-1456 (2012) - [c10]Andreas T. Ernst
Lagrangian Particle Swarm Optimization for a resource constrained machine scheduling problem. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2011
- [j23]Andreas T. Ernst
An efficient Lagrangean heuristic for rental vehicle scheduling. Comput. Oper. Res. 38(1): 216-226 (2011) - [j22]Gaurav Singh
Resource constraint scheduling with a fractional shared resource. Oper. Res. Lett. 39(5): 363-368 (2011) - [c9]Dhananjay Raghavan Thiruvady
Car sequencing with constraint-based ACO. GECCO 2011: 163-170 - 2010
- [j21]Andreas T. Ernst
Dynamic scheduling of recreational rental vehicles with revenue management extensions. J. Oper. Res. Soc. 61(7): 1133-1143 (2010) - [c8]Andreas T. Ernst
A hybrid Lagrangian Particle Swarm Optimization Algorithm for the degree-constrained minimum spanning tree problem. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j20]Andreas T. Ernst
Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7): 2230-2241 (2009) - [j19]T. Meyer, Andreas T. Ernst
A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12): 3143-3151 (2009) - [j18]Andreas T. Ernst
An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy. INFORMS J. Comput. 21(4): 562-574 (2009) - [c7]Manuel López-Ibáñez
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows. EvoCOP 2009: 97-108 - [c6]Dhananjay R. Thiruvady
Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling. Hybrid Metaheuristics 2009: 30-44 - 2008
- [c5]Andreas T. Ernst, Gaurav Singh, René Weiskircher:
Scheduling Meetings at Trade Events with Complex Preferences. ICAPS 2008: 76-82 - [c4]Dhananjay R. Thiruvady
Strip packing with hybrid ACO: Placement order is learnable. IEEE Congress on Evolutionary Computation 2008: 1207-1213 - 2007
- [j17]Andreas T. Ernst
Static and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited. Interfaces 37(4): 334-341 (2007) - [j16]Vicky H. Mak
New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP. Math. Methods Oper. Res. 66(1): 69-98 (2007) - [c3]Andreas T. Ernst, Gaurav Singh:
Taming Wind Energy with Battery Storage. OR 2007: 199-204 - 2006
- [j15]Andreas T. Ernst
Exact Solutions to Task Allocation Problems. Manag. Sci. 52(10): 1634-1646 (2006) - 2005
- [j14]James F. Campbell
Hub Arc Location Problems: Part I - Introduction and Results. Manag. Sci. 51(10): 1540-1555 (2005) - [j13]James F. Campbell
Hub Arc Location Problems: Part II - Formulations and Optimal Algorithms. Manag. Sci. 51(10): 1556-1571 (2005) - 2004
- [j12]Andreas T. Ernst, Houyuan Jiang, Mohan Krishnamoorthy
An Annotated Bibliography of Personnel Scheduling and Rostering. Ann. Oper. Res. 127(1-4): 21-144 (2004) - [j11]Andreas T. Ernst
Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1): 3-27 (2004) - [j10]Natashia Boland
Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3): 638-653 (2004) - [j9]Mark Berman, Harri T. Kiiveri, Ryan Lagerstrom, Andreas T. Ernst
ICE: a statistical approach to identifying endmembers in hyperspectral images. IEEE Trans. Geosci. Remote. Sens. 42(10): 2085-2095 (2004) - [c2]Bernd Meyer, Andreas T. Ernst:
Integrating ACO and Constraint Propagation. ANTS Workshop 2004: 166-177 - 2003
- [j8]Andreas T. Ernst, R. G. J. Mills, Palitha Welgama:
Scheduling Appointments at Trade Events for the Australian Tourist Commission. Interfaces 33(3): 12-23 (2003) - [j7]James F. Campbell
Solving hub arc location problems on a cluster of workstations. Parallel Comput. 29(5): 555-574 (2003) - [c1]Mark Berman, Harri T. Kiiveri, Ryan Lagerstrom, Andreas T. Ernst, Rob Dunne, Jonathan F. Huntington:
ICE: an automated statistical approach to identifying endmembers in hyperspectral images. IGARSS 2003: 279-283 - 2001
- [j6]Andreas T. Ernst
An Integrated Optimization Model for Train Crew Management. Ann. Oper. Res. 108(1-4): 211-224 (2001) - [j5]Mohan Krishnamoorthy
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. J. Heuristics 7(6): 587-611 (2001) - 2000
- [j4]Jamie Ebery, Mohan Krishnamoorthy
The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120(3): 614-631 (2000)
1990 – 1999
- 1999
- [j3]Andreas T. Ernst, Mohan Krishnamoorthy
Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86: 141-159 (1999) - [j2]Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer:
Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3): 229-241 (1999) - 1998
- [j1]Andreas T. Ernst, Mohan Krishnamoorthy:
An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems. INFORMS J. Comput. 10(2): 149-162 (1998)
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-12-10 20:51 CET 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: