The following pages link to Philip Kilby (Q204954):
Displaying 13 items.
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints (Q1591428) (← links)
- Approximation of the Shapley value for the Euclidean travelling salesman game (Q2158624) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- A Study of Proxies for Shapley Allocations of Transport Costs (Q2818236) (← links)
- Dynamic scheduling of recreational rental vehicles with revenue management extensions (Q3585722) (← links)
- (Q4495205) (← links)
- CP Methods for Scheduling and Routing with Time-Dependent Task Costs (Q4922907) (← links)
- Solving vehicle routing problems using constraint programming and metaheuristics (Q5944361) (← links)
- (Q6052037) (← links)
- A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles (Q6067894) (← links)
- Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach (Q6099458) (← links)
- Enhanced methods for the weight constrained shortest path problem (Q6566555) (← links)
