#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1986

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mike Benchimol, Pascal Benchimol, +4 authors Ludovic Robinet
- RAIRO - Operations Research
- 2011

This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the… (More)

- Pascal Benchimol, Willem Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher
- Constraints
- 2012

We study the weighted circuit constraint in the context of constraint programming. It appears as a substructure in many practical applications, particularly routing problems. We propose a domain filtering algorithm for the weighted circuit constraint that is based on the 1-tree relaxation of Held and Karp. In addition, we study domain filtering based on an… (More)

- Pascal Benchimol, Guy Desaulniers, Jacques Desrosiers
- European Journal of Operational Research
- 2012

- Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert
- ICALP
- 2014

We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadowvertex simplex algorithm, which solves mean payoff games via linear feasibility problems over… (More)

- Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig
- SIAM J. Discrete Math.
- 2015

We develop a tropical analogue of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m + n)) time, where m is the number of constraints and n is the dimension.

- E Anglés-Cano, B Boutière, +4 authors J Sampol
- Thrombosis and haemostasis
- 1987

Vascular or tissue-type plasminogen activator (plasma t-PA) is the circulating physiological fibrinolytic enzyme of endothelial cell origin which function is regulated by fibrin and a specific inhibitor (PAI). To study the pattern of release of t-PA and the behavior of t-PA-PAI complexes in plasma we determined t-PA activity in 44 healthy subjects before… (More)

- B Boutière, D Arnoux, P Benchimol, J Sampol, P Risède, E Anglés-Cano
- Thrombosis research
- 1986

- Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig
- SIAM Journal on Optimization
- 2014

A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an… (More)

Held and Karp have proposed, in the early 1970s, a relaxation for the Traveling Salesman Problem (TSP) as well as a branch-and-bound procedure that can solve small to modest-size instances to optimality [4, 5]. It has been shown that the Held-Karp relaxation produces very tight bounds in practice, and this relaxation is therefore applied in TSP solvers such… (More)

- ‹
- 1
- ›