In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality
In this article, we consider a variation of the vehicle routing problem arising in the optimization ...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing probl...
When logistic or e-commerce companies distribute all kinds of products to their customers, they want...
This tutorial introduces readers to several variants of routing problems with profits. In these rout...
none4siThe Team Orienteering Problem (TOP) is one of the most investigated problems in the family of...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem ...
International audienceA profit and a demand are associated with each edge of a set of profitable edg...
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A...
In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle ro...
In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle ro...
In this article, we consider a variation of the vehicle routing problem arising in the optimization ...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing probl...
When logistic or e-commerce companies distribute all kinds of products to their customers, they want...
This tutorial introduces readers to several variants of routing problems with profits. In these rout...
none4siThe Team Orienteering Problem (TOP) is one of the most investigated problems in the family of...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicl...
In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem ...
International audienceA profit and a demand are associated with each edge of a set of profitable edg...
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A...
In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle ro...
In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle ro...
In this article, we consider a variation of the vehicle routing problem arising in the optimization ...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
We review branch-and-price as an efficient algorithm to solve integer programming problems with huge...
DOI
Add to ORKG