The following pages link to Christian Prins (Q296677):
Displaying 50 items.
- A survey of recent research on location-routing problems (Q296678) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Work-troop scheduling for road network accessibility after a major earthquake (Q325475) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- Road network emergency accessibility planning after a major earthquake (Q339942) (← links)
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Competitive memetic algorithms for arc routing problems (Q702720) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- Competitive genetic algorithms for the open-shop scheduling problem (Q1401639) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- Metaheuristic framework for a disaster logistics problem with time-dependent demands (Q1691666) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- Variable neighborhood search for vehicle routing problem with multiple time windows (Q1791961) (← links)
- Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case (Q1868259) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- A new lower bound for the open-shop problem (Q1960317) (← links)
- A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
- A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
- (Q2770548) (← links)
- Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands (Q2954335) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
- Heuristic Approaches for the Robust Vehicle Routing Problem (Q3195347) (← links)
- Timing problems and algorithms: Time decisions for sequences of activities (Q4642457) (← links)
- Loading aircraft for military operations (Q4679623) (← links)
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← links)
