Whlk Sanne

Sanne Whlk

Information about the author Sanne Whlk will soon be added to the site.
Found 5 papers in total
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
2016
In this paper, we consider the Mixed Capacitated General Routing Problem which is a...
A variable neighborhood search for the multi-period collection of recyclable materials
A variable neighborhood search for the multi-period collection of recyclable materials
2016
We consider an approach for scheduling the multi‐period collection of...
Collection of recyclables from cubes ‐ A case study
Collection of recyclables from cubes ‐ A case study
2014
We study collection of paper and glass from recycling cubes. A heuristic based model...
A lower bound for the Node, Edge, and Arc Routing Problem
A lower bound for the Node, Edge, and Arc Routing Problem
2013
The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in...
New lower bound for the Capacitated Arc Routing Problem
New lower bound for the Capacitated Arc Routing Problem
2006
We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the...
Papers per page: