The following pages link to John E. Beasley (Q1683117):
Displaying 50 items.
- (Q322623) (redirect page) (← links)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows (Q375982) (← links)
- Market neutral portfolios (Q476263) (← links)
- Packing unequal circles using formulation space search (Q502435) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Factor neutral portfolios (Q747746) (← links)
- An algorithm for the two-dimensional assortment problem (Q759646) (← links)
- Scatter search and bionomic algorithms for the aircraft landing problem (Q817534) (← links)
- Path finding approaches and metabolic pathways (Q1026179) (← links)
- Improving Benders decomposition using a genetic algorithm (Q1042103) (← links)
- A note on solving large p-median problems (Q1060943) (← links)
- An algorithm for solving large capacitated warehouse location problems (Q1099067) (← links)
- A tree search algorithm for the p-median problem (Q1162434) (← links)
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Allocating fixed costs and resources via data envelopment analysis (Q1869546) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Obtaining test problems via Internet (Q1918988) (← links)
- Quantitative portfolio selection: using density forecasting to find consistent portfolios (Q2028791) (← links)
- Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- An optimisation approach to constructing an exchange-traded fund (Q2341093) (← links)
- Mixed-integer programming approaches for index tracking and enhanced indexation (Q2378489) (← links)
- Index tracking with fixed and variable transaction costs (Q2439491) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment (Q2664445) (← links)
- A discrete optimisation approach for target path planning whilst evading sensors (Q2669689) (← links)
- Scheduling Aircraft Landings—The Static Case (Q2783883) (← links)
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
- Linear Programming on Cray Supercomputers (Q3035131) (← links)
- Fixed Routes (Q3040927) (← links)
- Bounds for Two-Dimensional Cutting (Q3221736) (← links)
- The period routing problem (Q3329224) (← links)
- Restricting Weight Flexibility in Data Envelopment Analysis (Q3496119) (← links)
- A tabu search algorithm for the single vehicle routing allocation problem (Q3512571) (← links)
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure (Q3686413) (← links)
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting (Q3718470) (← links)
- An SST-based algorithm for the steiner problem in graphs (Q3813625) (← links)
- An algorithm for the resource constrained shortest path problem (Q3827808) (← links)
- Vehicle Fleet Composition (Q3967351) (← links)
- Locating Benefit Posts in Brazil (Q4287643) (← links)
- A delaunay triangulation‐based heuristic for the euclidean steiner problem (Q4303626) (← links)
