#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1999

2017

- This year (3)
- Last 5 years (14)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih
- CPAIOR
- 2005

- Babacar Thiongane, Anass Nagih, Gérard Plateau
- Discrete Applied Mathematics
- 2006

First, this paper deals with lagrangean heuristics for the 0–1 bidimensional knapsack problem.A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced… (More)

- Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau
- Annals OR
- 2011

- Lucas Létocart, Anass Nagih, Gérard Plateau
- Computers & OR
- 2012

Abstract The 0-1 quadratic knapsack problem consists of maximizing a quadratic objective function subject to a linear capacity constraint. To exactly solve large instances of this problem with a tree search algorithm (e.g., a branch and bound method), the knowledge of good lower and upper bounds is crucial for pruning the tree but also for fixing as many… (More)

- Nora Touati Moungla, Lucas Létocart, Anass Nagih
- Electronic Notes in Discrete Mathematics
- 2010

An efficient use of dynamic programming requires a substantial reduction of the number of labels. We propose in this paper an efficient way of reducing the number of labels saved and dominance computing time. Our approach is validated by experiments on shortest path problem with time windows instances.

- Babacar Thiongane, Anass Nagih, Gérard Plateau
- Annals OR
- 2005

- Anass Nagih, François Soumis
- European Journal of Operational Research
- 2006

The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on resource consumption. Its solving by a dynamic programming algorithm requires a computation time increasing with the number of resources. With the aim of producing rapidly a good heuristic solution we… (More)

- Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih
- ICNSC
- 2013

- Nora Touati Moungla, Lucas Létocart, Anass Nagih
- Algorithmic Operations Research
- 2010

- Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
- GECCO
- 2017

Real-life problems including transportation, planning and management often involve several decision makers whose actions depend on the interaction between each other. When involving two decision makers, such problems are classified as bi-level optimization problems. In terms of mathematical programming, a bi-level program can be described as two nested… (More)