The following pages link to Arne Løkketangen (Q191595):
Displaying 42 items.
- Two approaches for solving the buffer allocation problem in unreliable production lines (Q336569) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- (Q632655) (redirect page) (← links)
- Tabu search with path relinking for an integrated production-distribution problem (Q632656) (← links)
- A metaheuristic for stochastic service network design (Q707730) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- Experiments concerning sequential versus simultaneous maximization of objective function and distance (Q1009194) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
- Using scenario trees and progressive hedging for stochastic inventory routing problems (Q1044243) (← links)
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming (Q1357484) (← links)
- Interactive planning for sustainable forest management (Q1593476) (← links)
- Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
- A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
- Adaptive memory search for Boolean optimization problems (Q1878405) (← links)
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
- Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
- A tabu search approach for the livestock collection problem (Q2482370) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Arc routing in a node routing environment (Q2571193) (← links)
- Solving a rich vehicle routing and inventory problem using column generation (Q2655647) (← links)
- Integrating pivot based search with branch and bound for binary MIPs (Q2731680) (← links)
- Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems (Q2865877) (← links)
- Scenario tree-based heuristics for stochastic inventory-routing problems (Q2901065) (← links)
- An attribute based similarity function for VRP Decision Support (Q2966344) (← links)
- (Q3372329) (← links)
- (Q3500140) (← links)
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography (Q3564354) (← links)
- (Q3632444) (← links)
- (Q4216482) (← links)
- (Q4350067) (← links)
- (Q4375771) (← links)
- (Q4495177) (← links)
- Tabu search within a pivot and complement framework (Q4888240) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems (Q5295489) (← links)
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route (Q5429299) (← links)
- (Q5692631) (← links)
- Ship Routing Scheduling with Persistence and Distance Objecives (Q5850930) (← links)
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing (Q5938398) (← links)
