Julia A. Bennell
Orcid: 0000-0002-5338-2247Affiliations:
- Leeds University Business School, UK
- University of Southampton Business School, UK (former)
According to our database1,
Julia A. Bennell
authored at least 37 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Wirel. Networks, November, 2024
Commentary on Carroll & Esposito Amideo "Gender Equality: Opportunities and challenges for the OR community".
J. Oper. Res. Soc., June, 2024
2023
Oper. Res., July, 2023
2021
Int. J. Prod. Res., 2021
2019
Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues.
Eur. J. Oper. Res., 2019
2018
Eur. J. Oper. Res., 2018
Multicommodity flows and Benders decomposition for restricted continuous location problems.
Eur. J. Oper. Res., 2018
A beam search approach to solve the convex irregular bin packing problem with guillotine guts.
Eur. J. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins.
Proceedings of the Computational Logistics - 8th International Conference, 2017
2016
A modelling framework for solving restricted planar location problems using phi-objects.
J. Oper. Res. Soc., 2016
Int. Trans. Oper. Res., 2016
Proceedings of the Winter Simulation Conference, 2016
2015
2014
Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem.
J. Oper. Res. Soc., 2014
2013
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints.
Eur. J. Oper. Res., 2013
2012
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012
2011
Proceedings of the Computational Logistics - Second International Conference, 2011
2010
J. Heuristics, 2010
Ann. Oper. Res., 2010
2009
Expert Syst. Appl., 2009
2008
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums.
Comput. Oper. Res., 2008
2007
J. Oper. Res. Soc., 2007
2006
Expert Syst. Appl., 2006
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem.
Eur. J. Oper. Res., 2006
2004
Intell. Syst. Account. Finance Manag., 2004
2002
J. Oper. Res. Soc., 2002
2001
Manag. Sci., 2001
The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon.
Comput. Oper. Res., 2001
1998
J. Oper. Res. Soc., 1998