J. E. Beasley

From MaRDI portal
(Redirected from Person:322623)
Redirect page
Person:1683117

Redirect to:


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An optimal algorithm for variable knockout problems
4OR
2024-12-20Paper
An optimisation model for minimising changes in frequency allocations
EURO Journal on Computational Optimization
2023-07-12Paper
A heuristic for the non-unicost set covering problem using local branching
 
2022-07-07Paper
A discrete optimisation approach for target path planning whilst evading sensors
Computers & Operations Research
2022-03-09Paper
A two stage approach for order and rack allocation with order backlog in a mobile rack environment
 
2021-10-21Paper
A discrete optimisation approach for target path planning whilst evading sensors
 
2021-06-16Paper
Quantitative portfolio selection: using density forecasting to find consistent portfolios
European Journal of Operational Research
2021-06-03Paper
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
Computers & Operations Research
2021-04-20Paper
Order batching using an approximation for the distance travelled by pickers
European Journal of Operational Research
2020-05-07Paper
Packing a fixed number of identical circles in a circular container with circular prohibited areas
Optimization Letters
2019-10-18Paper
An algorithm for the optimal solution of variable knockout problems
 
2019-08-06Paper
Packing unequal rectangles and squares in a fixed size circular container using formulation space search
Computers & Operations Research
2018-07-11Paper
Optimally solving the joint order batching and picker routing problem
European Journal of Operational Research
2017-12-06Paper
Packing unequal circles using formulation space search
Computers & Operations Research
2017-01-05Paper
Modelling and solving the joint order batching and picker routing problem in inventories
Lecture Notes in Computer Science
2016-11-30Paper
A formulation space search heuristic for packing unequal circles in a fixed size circular container
European Journal of Operational Research
2016-10-07Paper
Factor neutral portfolios
OR Spectrum
2015-10-19Paper
An optimisation approach to constructing an exchange-traded fund
Optimization Letters
2015-04-23Paper
Market neutral portfolios
Optimization Letters
2014-11-28Paper
A note on solving MINLP's using formulation space search
Optimization Letters
2014-04-30Paper
Index tracking with fixed and variable transaction costs
Optimization Letters
2014-03-14Paper
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
Optimization Letters
2013-11-01Paper
A heuristic for the circle packing problem with a variety of containers
European Journal of Operational Research
2011-08-19Paper
Improving Benders decomposition using a genetic algorithm
European Journal of Operational Research
2009-12-07Paper
Path finding approaches and metabolic pathways
Discrete Applied Mathematics
2009-06-24Paper
Mixed-integer programming approaches for index tracking and enhanced indexation
European Journal of Operational Research
2009-01-08Paper
A tabu search algorithm for the single vehicle routing allocation problem
The Journal of the Operational Research Society
2008-07-21Paper
Scatter search and bionomic algorithms for the aircraft landing problem
European Journal of Operational Research
2006-03-16Paper
Displacement problem and dynamically scheduling aircraft landings
The Journal of the Operational Research Society
2005-04-04Paper
Scheduling aircraft landings at London Heathrow using a population heuristic
The Journal of the Operational Research Society
2005-03-16Paper
Placing boxes on shelves: a case study
The Journal of the Operational Research Society
2005-03-16Paper
Improving short-term conflict alert via tabu search
The Journal of the Operational Research Society
2005-03-14Paper
A population heuristic for constrained two-dimensional non-guillotine cutting
European Journal of Operational Research
2004-08-19Paper
Allocating fixed costs and resources via data envelopment analysis
European Journal of Operational Research
2003-04-10Paper
Scheduling aircraft landings -- the static case
Transportation Science
2002-10-17Paper
scientific article; zbMATH DE number 1064585 (Why is no real title available?)
 
2000-04-25Paper
Vehicle routing with a sparse feasibility graph
European Journal of Operational Research
1999-02-22Paper
A branch and cut algorithm for the Steiner problem in graphs
 
1998-03-05Paper
The vehicle routing-allocation problem: A unifying framework
Top
1997-02-23Paper
Obtaining test problems via Internet
Journal of Global Optimization
1996-07-23Paper
Determining Teaching and Research Efficiencies
The Journal of the Operational Research Society
1995-08-01Paper
A delaunay triangulation‐based heuristic for the euclidean steiner problem
Networks
1995-03-08Paper
Locating Benefit Posts in Brazil
The Journal of the Operational Research Society
1994-04-12Paper
Lagrangean heuristics for location problems
European Journal of Operational Research
1993-06-29Paper
Enhancing an algorithm for set covering problems
European Journal of Operational Research
1992-10-06Paper
A heuristic for Euclidean and rectilinear Steiner problems
European Journal of Operational Research
1992-10-06Paper
Restricting Weight Flexibility in Data Envelopment Analysis
The Journal of the Operational Research Society
1990-01-01Paper
scientific article; zbMATH DE number 4121754 (Why is no real title available?)
 
1990-01-01Paper
Linear Programming on Cray Supercomputers
The Journal of the Operational Research Society
1990-01-01Paper
An SST-based algorithm for the steiner problem in graphs
Networks
1989-01-01Paper
An algorithm for the resource constrained shortest path problem
Networks
1989-01-01Paper
An algorithm for solving large capacitated warehouse location problems
European Journal of Operational Research
1988-01-01Paper
An algorithm for set covering problem
European Journal of Operational Research
1987-01-01Paper
A note on solving large p-median problems
European Journal of Operational Research
1985-01-01Paper
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
Operations Research
1985-01-01Paper
Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
The Journal of the Operational Research Society
1985-01-01Paper
Bounds for Two-Dimensional Cutting
The Journal of the Operational Research Society
1985-01-01Paper
An algorithm for the two-dimensional assortment problem
European Journal of Operational Research
1985-01-01Paper
The period routing problem
Networks
1984-01-01Paper
Fixed Routes
The Journal of the Operational Research Society
1984-01-01Paper
An algorithm for the steiner problem in graphs
Networks
1984-01-01Paper
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
European Journal of Operational Research
1983-01-01Paper
Vehicle Fleet Composition
The Journal of the Operational Research Society
1983-01-01Paper
A tree search algorithm for the p-median problem
European Journal of Operational Research
1982-01-01Paper


Research outcomes over time


This page was built for person: J. E. Beasley