Blair Lennon Robertson

According to our database, Blair Lennon Robertson authored at least 8 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

One point per cluster spatially balanced sampling.

Blair Robertson, Christopher John Price

Comput. Stat. Data Anal., March, 2024

2021

Oscars-ii: an algorithm for bound constrained global optimization.

Christopher John Price, Marco Reale, Blair Lennon Robertson

J. Glob. Optim., 2021

2019

A comparative study on filtering methods for online freeway traffic estimation using heterogeneous data.

Xuan Sy Trinh, Dong Ngoduy, Mehdi Keyvan-Ekbatani, Blair Robertson

Proceedings of the 2019 IEEE Intelligent Transportation Systems Conference, 2019

2016

Stochastic filter methods for generally constrained global optimization.

Christopher John Price, Marco Reale, Blair Lennon Robertson

J. Glob. Optim., 2016

HHCART: An oblique decision tree.

Darshana Chitraka Wickramarachchi, Blair Lennon Robertson, Marco Reale, Christopher John Price, Jennifer Brown

Comput. Stat. Data Anal., 2016

2014

One side cut accelerated random search.

Christopher John Price, Marco Reale, Blair Lennon Robertson

Optim. Lett., 2014

2013

CARTopt: a random search method for nonsmooth unconstrained optimization.

Blair Lennon Robertson, Christopher John Price, Marco Reale

Comput. Optim. Appl., 2013

2012

A cover partitioning method for bound constrained global optimization.

Christopher John Price, Marco Reale, Blair Lennon Robertson

Optim. Methods Softw., 2012