#### Filter Results:

#### Publication Year

2008

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Abir Henchiri, Monia Bellalouna, Walid Khasnaji
- 2014

—The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the classic Traveling Salesman Problem (TSP) in which only a subset of potential nodes needs to be visited on any given instance of the problem. The number of nodes to be visited each time is a random variable. The objective is to find an a priori tour which minimizes the expected… (More)

In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of… (More)

- M. Bellalouna, W. Khaznaji, V. Paschos
- 2010

The Probabilistic Traveling Salesman Problem is in general NP-Hard, the objective of this paper is to look for particular cases which can be solved in an easy way. First we give the relation between the two problems deterministic and probabilistic. Second, we study the stability of the deterministic problem. We prove that in the small traveling salesman… (More)