default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulia A. Bennell
Person information
- affiliation: Leeds University Business School, UK
- affiliation (former): University of Southampton Business School, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Fotios Petropoulos
, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024)- [j33]Laura A. Albert, Annunziata Esposito Amideo, Julia A. Bennell, Sally C. Brailsford, Paula Carroll, Ruth Kaufman, Katherine Kent, Kathy Kotiadis, Martin H. Kunc, Anna Nagurney, Frances A. O'Brien, Graham Rand, M. Grazia Speranza:
Commentary on Carroll & Esposito Amideo "Gender Equality: Opportunities and challenges for the OR community". J. Oper. Res. Soc. 75(6): 1030-1042 (2024) - [j32]Julia A. Bennell, Igor S. Litvinchev, Aleksandr V. Pankratov, Tetyana Romanova:
Packing stretched convex polygons in an optimized rectangle. Wirel. Networks 30(8): 7369-7376 (2024) - 2023
- [j31]Zoia Duriagina, Alexander V. Pankratov, Tetyana Romanova, Igor S. Litvinchev, Julia A. Bennell, Igor Lemishka, Sergiy Maximov:
Optimized Packing Titanium Alloy Powder Particles. Comput. 11(2): 22 (2023) - [j30]Carlos Lamas-Fernandez, Julia A. Bennell, Antonio Martinez-Sykora:
Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem. Oper. Res. 71(4): 1298-1317 (2023) - 2021
- [j29]Christopher Bayliss, Christine S. M. Currie, Julia A. Bennell, Antonio Martinez-Sykora:
Queue-constrained packing: A vehicle ferry case study. Eur. J. Oper. Res. 289(2): 727-741 (2021) - [j28]Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Konstantin Avramov, Marina Chernobryvko, Igor Yanchevskyi, Iryna Mozgova, Julia A. Bennell:
Optimal layout of ellipses and its application for additive manufacturing. Int. J. Prod. Res. 59(2): 560-575 (2021)
2010 – 2019
- 2019
- [j27]Christopher Bayliss, Christine S. M. Currie, Julia A. Bennell, Antonio Martinez-Sykora:
Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues. Eur. J. Oper. Res. 273(1): 288-304 (2019) - 2018
- [j26]Murat Oguz, Tolga Bektas, Julia A. Bennell:
Multicommodity flows and Benders decomposition for restricted continuous location problems. Eur. J. Oper. Res. 266(3): 851-863 (2018) - [j25]Tatiana E. Romanova, Julia A. Bennell, Yu. G. Stoyan, Aleksandr V. Pankratov:
Packing of concave polyhedra with continuous rotations using nonlinear optimisation. Eur. J. Oper. Res. 268(1): 37-53 (2018) - [j24]Julia A. Bennell, Marta Cabo, Antonio Martinez-Sykora:
A beam search approach to solve the convex irregular bin packing problem with guillotine guts. Eur. J. Oper. Res. 270(1): 89-102 (2018) - 2017
- [j23]Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts:
Dynamic scheduling of aircraft landings. Eur. J. Oper. Res. 258(1): 315-327 (2017) - [j22]Antonio Martinez-Sykora, Ramón Alvarez-Valdés, Julia A. Bennell, Rubén Ruiz, José Manuel Tamarit:
Matheuristics for the irregular bin packing problem with free rotations. Eur. J. Oper. Res. 258(2): 440-455 (2017) - [c4]Ranga P. Abeysooriya, Julia A. Bennell, Antonio Martinez-Sykora:
Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins. ICCL 2017: 557-571 - 2016
- [j21]Xiaozhou Zhao, Julia A. Bennell, Tolga Bektas, Kathryn A. Dowsland:
A comparative review of 3D container loading algorithms. Int. Trans. Oper. Res. 23(1-2): 287-320 (2016) - [j20]Murat Oguz, Tolga Bektas, Julia A. Bennell, Jörg Fliege:
A modelling framework for solving restricted planar location problems using phi-objects. J. Oper. Res. Soc. 67(8): 1080-1096 (2016) - [c3]Christopher Bayliss, Julia A. Bennell, Christine S. M. Currie, Antonio Martinez-Sykora, Mee Chi So:
A Simheuristic approach to the vehicle ferry revenue management problem. WSC 2016: 2335-2346 - 2015
- [j19]Julia A. Bennell, Guntram Scheithauer, Yuri Stoyan, Tatiana E. Romanova, Aleksandr V. Pankratov:
Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3): 497-524 (2015) - 2014
- [j18]Xiang Song, Julia A. Bennell:
Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem. J. Oper. Res. Soc. 65(7): 1037-1052 (2014) - 2013
- [j17]Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts:
Airport runway scheduling. Ann. Oper. Res. 204(1): 249-270 (2013) - [j16]Wei Han, Julia A. Bennell, Xiaozhou Zhao, Xiang Song:
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints. Eur. J. Oper. Res. 230(3): 495-504 (2013) - 2012
- [c2]Banafsheh Khosravi, Julia A. Bennell, Chris N. Potts:
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure. ATMOS 2012: 120-131 - 2011
- [j15]Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts:
Airport runway scheduling. 4OR 9(2): 115-138 (2011) - [c1]Fotini Malliappi, Julia A. Bennell, Chris N. Potts:
A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling. ICCL 2011: 273-285 - 2010
- [j14]Julia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana E. Romanova:
Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. 179(1): 343-368 (2010) - [j13]Julia A. Bennell, Xiang Song:
A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2): 167-188 (2010)
2000 – 2009
- 2009
- [j12]Ross A. McDonald, Paul Skipp, Julia A. Bennell, Chris N. Potts, Lyn C. Thomas, C. David O'Connor:
Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview. Expert Syst. Appl. 36(3): 5333-5340 (2009) - [j11]Julia A. Bennell, José Fernando Oliveira:
A tutorial in irregular shape packing problems. J. Oper. Res. Soc. 60(S1) (2009) - 2008
- [j10]Julia A. Bennell, Xiang Song:
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35(1): 267-281 (2008) - [j9]Julia A. Bennell, José Fernando Oliveira:
The geometry of nesting problems: A tutorial. Eur. J. Oper. Res. 184(2): 397-415 (2008) - 2007
- [j8]L. Huyao, H. Yuanjun, Julia A. Bennell:
The irregular nesting problem: a new approach for nofit polygon calculation. J. Oper. Res. Soc. 58(9): 1235-1245 (2007) - 2006
- [j7]Xiang Song, C. B. Chu, Y. Y. Nie, Julia A. Bennell:
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem. Eur. J. Oper. Res. 175(3): 1870-1889 (2006) - [j6]Julia A. Bennell, David Crabbe, Stephen Thomas, Owain ap Gwilym:
Modelling sovereign credit ratings: Neural networks versus ordered probit. Expert Syst. Appl. 30(3): 415-425 (2006) - 2004
- [j5]Julia A. Bennell, Charles Sutcliffe:
Black-Scholes versus artificial neural networks in pricing FTSE 100 options. Intell. Syst. Account. Finance Manag. 12(4): 243-260 (2004) - 2002
- [j4]Julia A. Bennell, Chris N. Potts, J. Douglass Whitehead:
Local search algorithms for the min-max loop layout problem. J. Oper. Res. Soc. 53(10): 1109-1117 (2002) - 2001
- [j3]Julia A. Bennell, Kathryn A. Dowsland, William B. Dowsland:
The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28(3): 271-287 (2001) - [j2]Julia A. Bennell, Kathryn A. Dowsland:
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting. Manag. Sci. 47(8): 1160-1172 (2001)
1990 – 1999
- 1998
- [j1]Kathryn A. Dowsland, William B. Dowsland, Julia A. Bennell:
Jostling for position: local improvement for irregular cutting patterns. J. Oper. Res. Soc. 49(6): 647-658 (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-23 19:31 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:
