The following pages link to Sanne Wøhlk (Q320991):
Displaying 20 items.
- A variable neighborhood search for the multi-period collection of recyclable materials (Q320992) (← links)
- The time-dependent prize-collecting arc routing problem (Q340251) (← links)
- A lower bound for the node, edge, and arc routing problem (Q340291) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
- Transport of skips between recycling centers and treatment facilities (Q2147169) (← links)
- Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting (Q2158017) (← links)
- A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
- New lower bound for the capacitated arc routing problem (Q2496046) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- Freight railway operator timetabling and engine scheduling (Q2629669) (← links)
- An Approximation Algorithm for the Capacitated Arc Routing Problem (Q3192847) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- Fundamentals of Computation Theory (Q5492945) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- On the effect of using sensors and dynamic forecasts in inventory-routing problems (Q5883614) (← links)
- A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation (Q6068721) (← links)
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection (Q6568490) (← links)
