#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2005

2017

- This year (0)
- Last 5 years (1)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Victor Chepoi, Karim Nouioua, Yann Vaxès
- APPROX-RANDOM
- 2005

For a set T of n points (terminals) in the plane, a Manhattan network on T is a network N(T ) = (V, E) with the property that its edges are horizontal or vertical segments connecting points in V ⊇ T… (More)

This paper introduces LocalSolver 1.x, a black-box local-search solver for general 0-1 programming. This software allows OR practitioners to focus on the modeling of the problem using a simple… (More)

- Bertrand Estellon, Frédéric Gardi, Karim Nouioua
- SLS
- 2009

In this paper, a real-life problem of task scheduling with human resource allocation is addressed. This problem was approached by the authors in the context of the ROADEF 2007 Challenge, which is an… (More)

- Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès
- Algorithmica
- 2005

In this paper we present a polynomial time algorithm for solving the problem of partial covering of trees with n1 balls of radius R1 and n2 balls of radius R2 (R1 < R2) to maximize the total number… (More)

- Frédéric Gardi, Karim Nouioua
- EvoCOP
- 2011

A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is illustrated through the… (More)

- Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès
- Int. J. Comput. Geometry Appl.
- 2010

For a set T of n points in a metric space (X, d), a point y ∈ X is dominated by a point x ∈ X if d(x, t) ≤ d(y, t) for all t ∈ T and there exists t ∈ T such that d(x, t) < d(y, t). The set of… (More)

- Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès
- Algorithmica
- 2011

Let ${\mathcal{B}}$ be a centrally symmetric convex polygon of ℝ2 and ‖p−q‖ be the distance between two points p,q∈ℝ2 in the normed plane whose unit ball is ${\mathcal{B}}$ . For a set T of n points… (More)

- Victor Chepoi, Karim Nouioua, Yann Vaxès
- Theor. Comput. Sci.
- 2008

- Bertrand Estellon, Frédéric Gardi, Karim Nouioua
- RAIRO - Operations Research
- 2006

The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when… (More)

- Victor Chepoi, Karim Nouioua
- Symposium on Computational Geometry
- 2007

Given a vector objective function f = (f<sub>1</sub>,...,f<sub>n</sub>) defined on a set X, a point y∈X is <i>dominated</i> by a point x∈ X if f<sub>i</sub>(x) < f<sub>i</sub>(y) forall i∈(1,...,n)… (More)