We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILP-formulation based on a new class of inequalities (subtour number constraints) is presented. The associated Hamiltonian p–median polytope is examined, in particular its dimension and its affine hull. We determine which of the defining inequalities induce facets.
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t...
In this dissertation we study two problems. In the first part of the dissertation we study the multi...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
Location-Routing problems involve locating a number of facilities among candidate sites and establis...
The paper is concerned with a new mixed routing location problem embedding the p - median and the tr...
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit con-strain...
The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour...
The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two w...
AbstractThe monotone asymmetric travelling salesman polytope P̄nT is defined to be the convex hull o...
This paper studies the asymmetric Hamiltonian p-median problem, which consists of finding p mutually...
The Miller-Tucker-Zemlin (MTZ) subtour elimination constraints (SECs) and the improved version by De...
When a company is faced with an extremely large vehicle routing problem, an interest-ing option is t...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
The Stacker-Crane Problem (SCP) consists of finding the minimum length hamiltonian cycle on a mixed ...
We consider a constrained asymmetric traveling salesman problem with knapsack-like constraints on su...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t...
In this dissertation we study two problems. In the first part of the dissertation we study the multi...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
Location-Routing problems involve locating a number of facilities among candidate sites and establis...
The paper is concerned with a new mixed routing location problem embedding the p - median and the tr...
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit con-strain...
The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour...
The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two w...
AbstractThe monotone asymmetric travelling salesman polytope P̄nT is defined to be the convex hull o...
This paper studies the asymmetric Hamiltonian p-median problem, which consists of finding p mutually...
The Miller-Tucker-Zemlin (MTZ) subtour elimination constraints (SECs) and the improved version by De...
When a company is faced with an extremely large vehicle routing problem, an interest-ing option is t...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
The Stacker-Crane Problem (SCP) consists of finding the minimum length hamiltonian cycle on a mixed ...
We consider a constrained asymmetric traveling salesman problem with knapsack-like constraints on su...
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t...
In this dissertation we study two problems. In the first part of the dissertation we study the multi...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...