Integer and combinatorial optimization
Integer and combinatorial optimization
A new class of cutting planes for the symmetric travelling salesman problem
Mathematical Programming: Series A and B
Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics - Combinatorial Optimization
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Mathematical Programming: Series A and B
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope
Mathematical Programming: Series A and B
Polyhedral study of the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Parallel branch and cut for vehicle routing
Parallel branch and cut for vehicle routing
A new generic separation routine and its application in a branch and cut algorithm for the capacitated vehicle routing problem
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
Sequential search and its application to vehicle-routing problems
Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
Applied Soft Computing
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers and Operations Research
Fifty Years of Vehicle Routing
Transportation Science
Lagrangian duality applied to the vehicle routing problem with time windows
Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
The bi-objective stochastic covering tour problem
Computers and Operations Research
The multi-depot periodic vehicle routing problem
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
| Hi-index | 0.00 |