A multi-level capacitated arc routing problem with intermediate facilities in waste collection.

A branch-and-cut algorithm for a skip pick-up and delivery problem.

A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation.

On the effect of using sensors and dynamic forecasts in inventory-routing problems.

A bi-objective k-nearest-neighbors-based imputation method for multilevel data.

Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting.

Transport of skips between recycling centers and treatment facilities.

Solution of the maximal covering tour problem for locating recycling drop-off stations.

A Branch-and-Price algorithm for two multi-compartment vehicle routing problems.

A districting-based heuristic for the coordinated capacitated arc routing problem.

A fast heuristic for large-scale capacitated arc routing problems.

New large-scale data instances for CARP and new variations of CARP.

Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems.

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs.

A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem.

A variable neighborhood search for the multi-period collection of recyclable materials.

Freight railway operator timetabling and engine scheduling.

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem.

The time-dependent prize-collecting arc routing problem.

A lower bound for the Node, Edge, and Arc Routing Problem.

Competitive analysis of the online inventory problem.

A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands.

The maximum resource bin packing problem.

New lower bound for the Capacitated Arc Routing Problem.