John E. Beasley

4OR, December, 2024

A heuristic for the non-unicost set covering problem using local branching.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., September, 2024

2022

An optimisation model for minimising changes in frequency allocations.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2022

A discrete optimisation approach for target path planning whilst evading sensors.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

2021

Quantitative portfolio selection: Using density forecasting to find consistent portfolios.

[BibT_eX]

[DOI]

Christopher J. Adcock

Eur. J. Oper. Res., 2021

Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

Order batching using an approximation for the distance travelled by pickers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

2019

Packing a fixed number of identical circles in a circular container with circular prohibited areas.

[BibT_eX]

[DOI]

Optim. Lett., 2019

2018

Packing unequal rectangles and squares in a fixed size circular container using formulation space search.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

2017

Optimally solving the joint order batching and picker routing problem.

[BibT_eX]

[DOI]

Alexandre Salles da Cunha

Eur. J. Oper. Res., 2017

2016

A formulation space search heuristic for packing unequal circles in a fixed size circular container.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories.

[BibT_eX]

[DOI]

Alexandre Salles da Cunha

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Factor neutral portfolios.

[BibT_eX]

[DOI]

OR Spectr., 2015

An optimisation approach to constructing an exchange-traded fund.

[BibT_eX]

[DOI]

José Manuel García Carrasco

Optim. Lett., 2015

TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm.

[BibT_eX]

[DOI]

Bioinform., 2015

Advances in network-based metabolic pathway analysis and gene expression data integration.

[BibT_eX]

[DOI]

Briefings Bioinform., 2015

2014

Market neutral portfolios.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Index tracking with fixed and variable transaction costs.

[BibT_eX]

[DOI]

H. Mezali

Optim. Lett., 2014

A note on solving MINLP's using formulation space search.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Refining carbon flux paths using atomic trace data.

[BibT_eX]

[DOI]

Jon Pey

Bioinform., 2014

2013

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows.

[BibT_eX]

[DOI]

Aida Mauziah Benjamin

Optim. Lett., 2013

Quantile regression for index tracking and enhanced indexation.

[BibT_eX]

[DOI]

H. Mezali

J. Oper. Res. Soc., 2013

Packing unequal circles using formulation space search.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2013

2011

Optimisation of sludge treatment and transport.

[BibT_eX]

[DOI]

G. Mitchell

J. Oper. Res. Soc., 2011

Heuristic algorithms for the cardinality constrained efficient frontier.

[BibT_eX]

[DOI]

Maria Woodside-Oriakhi

Cormac Lucas

Eur. J. Oper. Res., 2011

A heuristic for the circle packing problem with a variety of containers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

2010

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities.

[BibT_eX]

[DOI]

Aida Mauziah Benjamin

Comput. Oper. Res., 2010

2009

Multidimensional Knapsack Problems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Improving benders decomposition using a genetic algorithm.

[BibT_eX]

[DOI]

Chandra A. Poojari

Eur. J. Oper. Res., 2009

Mixed-integer programming approaches for index tracking and enhanced indexation.

[BibT_eX]

[DOI]

N. A. Canakgoz

Eur. J. Oper. Res., 2009

Path finding approaches and metabolic pathways.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

An optimization model for metabolic pathways.

[BibT_eX]

[DOI]

Bioinform., 2009

Computing the shortest elementary flux modes in genome-scale metabolic networks.

[BibT_eX]

[DOI]

Luis F. de Figueiredo

Bioinform., 2009

2008

A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions.

[BibT_eX]

[DOI]

F. Alonso

M. Jesús Alvarez

J. Oper. Res. Soc., 2008

A critical examination of stoichiometric and path-finding approaches to metabolic pathways.

[BibT_eX]

[DOI]

Briefings Bioinform., 2008

2007

A tabu search algorithm for the single vehicle routing allocation problem.

[BibT_eX]

[DOI]

L. Vogt

Chandra A. Poojari

J. Oper. Res. Soc., 2007

Recovering metabolic pathways via optimization.

[BibT_eX]

[DOI]

Bioinform., 2007

2006

Scatter Search and Bionomic Algorithms for the aircraft landing problem.

[BibT_eX]

[DOI]

H. Pinol

Eur. J. Oper. Res., 2006

2004

Displacement problem and dynamically scheduling aircraft landings.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2004

An Iterative Construction Heuristic for the Ore Selection Problem.

[BibT_eX]

[DOI]

A. J. Richmond

J. Heuristics, 2004

A population heuristic for constrained two-dimensional non-guillotine cutting.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2004

2003

The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.

[BibT_eX]

[DOI]

E. M. Cochrane

Neural Networks, 2003

An evolutionary heuristic for the index tracking problem.

[BibT_eX]

[DOI]

T.-J. Chang

Eur. J. Oper. Res., 2003

Allocating fixed costs and resources via data envelopment analysis.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

2002

Improving short-term conflict alert via tabu search.

[BibT_eX]

[DOI]

H. Howells

Julia Sonander

J. Oper. Res. Soc., 2002

2001

Placing boxes on shelves: a case study.

[BibT_eX]

[DOI]

N. P. Hoare

J. Oper. Res. Soc., 2001

Scheduling aircraft landings at London Heathrow using a population heuristic.

[BibT_eX]

[DOI]

Julia Sonander

P. Havelock

J. Oper. Res. Soc., 2001

2000

Scheduling Aircraft Landings - The Static Case.

[BibT_eX]

[DOI]

Transp. Sci., 2000

Heuristics for cardinality constrained portfolio optimisation.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2000

1999

Foreword.

[BibT_eX]

[DOI]

Yazid M. Sharaiha

Ann. Oper. Res., 1999

1998

A branch and cut algorithm for the Steiner problem in graphs.

[BibT_eX]

[DOI]

Abilio Lucena

Networks, 1998

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem.

[BibT_eX]

[DOI]

P. C. Chu

J. Heuristics, 1998

A Genetic Algorithm for the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

P. C. Chu

J. Heuristics, 1998

A dynamic programming based algorithm for the crew scheduling problem.

[BibT_eX]

[DOI]

B. Cao

Comput. Oper. Res., 1998

1997

A genetic algorithm for the generalised assignment problem.

[BibT_eX]

[DOI]

P. C. Chu

Comput. Oper. Res., 1997

1996

Obtaining test problems via Internet.

[BibT_eX]

[DOI]

J. Glob. Optim., 1996

1994

A delaunay triangulation-based heuristic for the euclidean steiner problem.

[BibT_eX]

[DOI]

F. Goffinet

Networks, 1994

1989

An algorithm for the resource constrained shortest path problem.

[BibT_eX]

[DOI]

Nicos Christofides

Networks, 1989

An SST-based algorithm for the steiner problem in graphs.

[BibT_eX]

[DOI]

Networks, 1989

1985

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure.

[BibT_eX]

[DOI]

Oper. Res., 1985

1984

The period routing problem.

[BibT_eX]

[DOI]

Nicos Christofides

Networks, 1984

An algorithm for the steiner problem in graphs.

[BibT_eX]

[DOI]