default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn E. Beasley
Person information
- affiliation: Brunel University London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j60]John E. Beasley
:
A heuristic for the non-unicost set covering problem using local branching. Int. Trans. Oper. Res. 31(5): 2807-2825 (2024)- 2022
- [j59]John E. Beasley:
A discrete optimisation approach for target path planning whilst evading sensors. Comput. Oper. Res. 138: 105587 (2022) - [j58]John E. Beasley:
An optimisation model for minimising changes in frequency allocations. EURO J. Comput. Optim. 10: 100042 (2022) - 2021
- [j57]Cristiano Arbex Valle, John E. Beasley:
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. Comput. Oper. Res. 125: 105090 (2021) - [j56]Nigel Meade, John E. Beasley, Christopher J. Adcock:
Quantitative portfolio selection: Using density forecasting to find consistent portfolios. Eur. J. Oper. Res. 288(3): 1053-1067 (2021) - [i3]John E. Beasley:
A discrete optimisation approach for target path planning whilst evading sensors. CoRR abs/2106.08826 (2021) - 2020
- [j55]Cristiano Arbex Valle, John E. Beasley:
Order batching using an approximation for the distance travelled by pickers. Eur. J. Oper. Res. 284(2): 460-484 (2020)
2010 – 2019
- 2019
- [j54]Claudia O. López, John E. Beasley:
Packing a fixed number of identical circles in a circular container with circular prohibited areas. Optim. Lett. 13(7): 1449-1468 (2019) - [i2]Cristiano Arbex Valle, John E. Beasley:
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. CoRR abs/1903.06702 (2019) - 2018
- [j53]Claudia O. López, John E. Beasley:
Packing unequal rectangles and squares in a fixed size circular container using formulation space search. Comput. Oper. Res. 94: 106-117 (2018) - 2017
- [j52]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3): 817-834 (2017) - [i1]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Optimally solving the joint order batching and picker routing problem. CoRR abs/1703.06531 (2017) - 2016
- [j51]Claudia O. López, John E. Beasley:
A formulation space search heuristic for packing unequal circles in a fixed size circular container. Eur. J. Oper. Res. 251(1): 64-73 (2016) - [c1]Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. ISCO 2016: 81-97 - 2015
- [j50]Alberto Rezola, Jon Pey, Luis Tobalina, Ángel Rubio, John E. Beasley, Francisco J. Planes:
Advances in network-based metabolic pathway analysis and gene expression data integration. Briefings Bioinform. 16(2): 265-279 (2015) - [j49]Jon Pey, Juan A. Villar, Luis Tobalina, Alberto Rezola, José Manuel García Carrasco, John E. Beasley, Francisco J. Planes:
TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm. Bioinform. 31(6): 897-904 (2015) - [j48]Cristiano Arbex Valle, Nigel Meade, John E. Beasley:
An optimisation approach to constructing an exchange-traded fund. Optim. Lett. 9(4): 635-661 (2015) - [j47]Cristiano Arbex Valle, Nigel Meade, John E. Beasley:
Factor neutral portfolios. OR Spectr. 37(4): 843-867 (2015) - 2014
- [j46]Jon Pey, Francisco J. Planes, John E. Beasley:
Refining carbon flux paths using atomic trace data. Bioinform. 30(7): 975-980 (2014) - [j45]H. Mezali, John E. Beasley:
Index tracking with fixed and variable transaction costs. Optim. Lett. 8(1): 61-80 (2014) - [j44]Claudia O. López, John E. Beasley:
A note on solving MINLP's using formulation space search. Optim. Lett. 8(3): 1167-1182 (2014) - [j43]Cristiano Arbex Valle, Nigel Meade, John E. Beasley:
Market neutral portfolios. Optim. Lett. 8(7): 1961-1984 (2014) - 2013
- [j42]Jon Pey, Kaspar Valgepea, Angel Rubio, John E. Beasley, Francisco J. Planes:
Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways. BMC Syst. Biol. 7: 134 (2013) - [j41]Claudia O. López, John E. Beasley:
Packing unequal circles using formulation space search. Comput. Oper. Res. 40(5): 1276-1288 (2013) - [j40]H. Mezali, John E. Beasley:
Quantile regression for index tracking and enhanced indexation. J. Oper. Res. Soc. 64(11): 1676-1692 (2013) - [j39]Aida Mauziah Benjamin, John E. Beasley:
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. Optim. Lett. 7(7): 1433-1449 (2013) - 2011
- [j38]Maria Woodside-Oriakhi, Cormac Lucas, John E. Beasley:
Heuristic algorithms for the cardinality constrained efficient frontier. Eur. J. Oper. Res. 213(3): 538-550 (2011) - [j37]Claudia O. López, John E. Beasley:
A heuristic for the circle packing problem with a variety of containers. Eur. J. Oper. Res. 214(3): 512-525 (2011) - [j36]G. Mitchell, John E. Beasley:
Optimisation of sludge treatment and transport. J. Oper. Res. Soc. 62(6): 939-948 (2011) - 2010
- [j35]Aida Mauziah Benjamin, John E. Beasley:
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 37(12): 2270-2280 (2010)
2000 – 2009
- 2009
- [j34]Francisco J. Planes, John E. Beasley:
An optimization model for metabolic pathways. Bioinform. 25(20): 2723-2729 (2009) - [j33]Luis F. de Figueiredo, Adam Podhorski, Angel Rubio, Christoph Kaleta, John E. Beasley, Stefan Schuster, Francisco J. Planes:
Computing the shortest elementary flux modes in genome-scale metabolic networks. Bioinform. 25(23): 3158-3165 (2009) - [j32]Francisco J. Planes, John E. Beasley:
Path finding approaches and metabolic pathways. Discret. Appl. Math. 157(10): 2244-2256 (2009) - [j31]N. A. Canakgoz, John E. Beasley:
Mixed-integer programming approaches for index tracking and enhanced indexation. Eur. J. Oper. Res. 196(1): 384-399 (2009) - [j30]Chandra A. Poojari, John E. Beasley:
Improving benders decomposition using a genetic algorithm. Eur. J. Oper. Res. 199(1): 89-97 (2009) - [r1]John E. Beasley:
Multidimensional Knapsack Problems. Encyclopedia of Optimization 2009: 2402-2406 - 2008
- [j29]Francisco J. Planes, John E. Beasley:
A critical examination of stoichiometric and path-finding approaches to metabolic pathways. Briefings Bioinform. 9(5): 422-436 (2008) - [j28]F. Alonso, M. Jesús Alvarez, John E. Beasley:
A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. 59(7): 963-976 (2008) - 2007
- [j27]John E. Beasley, Francisco J. Planes:
Recovering metabolic pathways via optimization. Bioinform. 23(1): 92-98 (2007) - [j26]L. Vogt, Chandra A. Poojari, John E. Beasley:
A tabu search algorithm for the single vehicle routing allocation problem. J. Oper. Res. Soc. 58(4): 467-480 (2007) - 2006
- [j25]H. Pinol, John E. Beasley:
Scatter Search and Bionomic Algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2): 439-462 (2006) - 2004
- [j24]John E. Beasley:
A population heuristic for constrained two-dimensional non-guillotine cutting. Eur. J. Oper. Res. 156(3): 601-627 (2004) - [j23]A. J. Richmond, John E. Beasley:
An Iterative Construction Heuristic for the Ore Selection Problem. J. Heuristics 10(2): 153-167 (2004) - [j22]John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson:
Displacement problem and dynamically scheduling aircraft landings. J. Oper. Res. Soc. 55(1): 54-64 (2004) - 2003
- [j21]John E. Beasley:
Allocating fixed costs and resources via data envelopment analysis. Eur. J. Oper. Res. 147(1): 198-216 (2003) - [j20]John E. Beasley, Nigel Meade, T.-J. Chang:
An evolutionary heuristic for the index tracking problem. Eur. J. Oper. Res. 148(3): 621-643 (2003) - [j19]E. M. Cochrane, John E. Beasley:
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Neural Networks 16(10): 1499-1525 (2003) - 2002
- [j18]John E. Beasley, H. Howells, Julia Sonander:
Improving short-term conflict alert via tabu search. J. Oper. Res. Soc. 53(6): 593-602 (2002) - 2001
- [j17]John E. Beasley, Julia Sonander, P. Havelock:
Scheduling aircraft landings at London Heathrow using a population heuristic. J. Oper. Res. Soc. 52(5): 483-493 (2001) - [j16]N. P. Hoare, John E. Beasley:
Placing boxes on shelves: a case study. J. Oper. Res. Soc. 52(6): 605-614 (2001) - 2000
- [j15]T.-J. Chang, Nigel Meade, John E. Beasley, Yazid M. Sharaiha:
Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13): 1271-1302 (2000) - [j14]John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson:
Scheduling Aircraft Landings - The Static Case. Transp. Sci. 34(2): 180-197 (2000)
1990 – 1999
- 1999
- [j13]Yazid M. Sharaiha, John E. Beasley:
Foreword. Ann. Oper. Res. 86: 0 (1999) - 1998
- [j12]John E. Beasley, B. Cao:
A dynamic programming based algorithm for the crew scheduling problem. Comput. Oper. Res. 25(7-8): 567-582 (1998) - [j11]P. C. Chu, John E. Beasley:
A Genetic Algorithm for the Multidimensional Knapsack Problem. J. Heuristics 4(1): 63-86 (1998) - [j10]P. C. Chu, John E. Beasley:
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem. J. Heuristics 4(4): 323-357 (1998) - [j9]Abilio Lucena, John E. Beasley:
A branch and cut algorithm for the Steiner problem in graphs. Networks 31(1): 39-59 (1998) - 1997
- [j8]P. C. Chu, John E. Beasley:
A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1): 17-23 (1997) - 1996
- [j7]John E. Beasley:
Obtaining test problems via Internet. J. Glob. Optim. 8(4): 429-433 (1996) - 1994
- [j6]John E. Beasley, F. Goffinet:
A delaunay triangulation-based heuristic for the euclidean steiner problem. Networks 24(4): 215-224 (1994)
1980 – 1989
- 1989
- [j5]John E. Beasley:
An SST-based algorithm for the steiner problem in graphs. Networks 19(1): 1-16 (1989) - [j4]John E. Beasley, Nicos Christofides:
An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989) - 1985
- [j3]John E. Beasley:
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure. Oper. Res. 33(1): 49-64 (1985) - 1984
- [j2]John E. Beasley:
An algorithm for the steiner problem in graphs. Networks 14(1): 147-159 (1984) - [j1]Nicos Christofides, John E. Beasley:
The period routing problem. Networks 14(2): 237-256 (1984)
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 21:20 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:
