Julia A. Bennell - Citegraph

Author Info

Name	Affiliation	Papers
JULIA A. BENNELL	CORMSIS, School of Management, University of Southampton, Southampton, SO17 1BJ UK	28
Collaborators	Citations	PageRank
47	275	18.59
Referers	Referees	References
480	495	362

Search Limit

100495

Publications (28 rows)

Collaborators (47 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Optimal Layout Of Ellipses And Its Application For Additive Manufacturing	0	0.34	2021
Queue-constrained packing: A vehicle ferry case study	0	0.34	2021
Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues.	0	0.34	2019
Multicommodity flows and Benders decomposition for restricted continuous location problems.	0	0.34	2018
A beam search approach to solve the convex irregular bin packing problem with guillotine guts.	1	0.37	2018
Packing of concave polyhedra with continuous rotations using nonlinear optimisation.	2	0.37	2018
Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins.	0	0.34	2017
Dynamic scheduling of aircraft landings.	3	0.39	2017
Matheuristics for the irregular bin packing problem with free rotations.	6	0.45	2017
A Simheuristic approach to the vehicle ferry revenue management problem.	0	0.34	2016
A Comparative Review Of 3d Container Loading Algorithms	15	0.61	2016
A modelling framework for solving restricted planar location problems using phi-objects.	0	0.34	2016
Optimal clustering of a pair of irregular objects	3	0.41	2015
Airport runway scheduling	15	0.64	2013
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints.	11	0.55	2013
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure.	2	0.40	2012
A variable neighborhood search heuristic for tramp ship scheduling	6	0.49	2011
Tools of mathematical modeling of arbitrary object packing problems	16	0.99	2010
A beam search implementation for the irregular shape packing problem	22	0.71	2010
A tutorial in irregular shape packing problems	25	0.84	2009
Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview	5	0.46	2009
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums	20	0.91	2008
The geometry of nesting problems: A tutorial	45	1.99	2008
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem.	10	0.59	2006
Modelling sovereign credit ratings: Neural networks versus ordered probit	13	0.76	2006
Black-Scholes versus artificial neural networks in pricing FTSE 100 options	13	1.11	2004
The irregular cutting-stock problem — a new procedure for deriving the no-fit polygon	11	1.25	2001
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting.	31	1.93	2001