Pages that link to "Item:Q2583137"

The following pages link to A new ILP-based refinement heuristic for vehicle routing problems (Q2583137):

Displaying 30 items.

• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• Consolidating home meal delivery with limited operational disruption (Q319069) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
• An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
• The capacitated general windy routing problem with turn penalties (Q433125) (← links)
• Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
• A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
• The time constrained maximal covering salesman problem (Q1631991) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
• Large-scale vehicle routing problems: quantum annealing, tunings and results (Q1652398) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
• Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• MIPping closures: An instant survey (Q2373443) (← links)
• Further extension of the TSP assign neighborhood (Q2491321) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)