Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. - Anass Nagih; Gérard Plateau (RAIRO Oper. Res., 1999)

Analyse de sensibilité pour les problèmes linéaires en variables 0-1. - Babacar Thiongane; Anass Nagih; Gérard Plateau (RAIRO Oper. Res., 2003)

Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. - Mohand Ou Idir Khemmoudj; Hachemi Bennaceur; Anass Nagih (CPAIOR, 2005)

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual. - Babacar Thiongane; Anass Nagih; Gérard Plateau (Ann. Oper. Res., 2005)

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem. - Babacar Thiongane; Anass Nagih; Gérard Plateau (Discret. Appl. Math., 2006)

Nodal aggregation of resource constraints in a shortest path problem. - Anass Nagih; François Soumis (Eur. J. Oper. Res., 2006)

Rapport de recherche sur le problème du plus court chemin contraint - Olivier Laval; Sophie Toulouse; Anass Nagih (CoRR, 2008)

Solutions diversification in a column generation algorithm. - Nora Touati Moungla; Lucas Létocart; Anass Nagih (Algorithmic Oper. Res., 2010)

An improving dynamic programming algorithm to solve the shortest path problem with time windows. - Nora Touati Moungla; Lucas Létocart; Anass Nagih (Electron. Notes Discret. Math., 2010)

Certification Watermarking for Digital Handheld-captured Photography. - Yves Stadler; Yann Lanuel; Anass Nagih; Francine Herrmann (PECCS, 2011)

A MIP flow model for crop-rotation planning in a context of forest sustainable development. - Laurent Alfandari; J. L. Lemalade; Anass Nagih; Gérard Plateau (Ann. Oper. Res., 2011)

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. - Lucas Létocart; Anass Nagih; Gérard Plateau (Comput. Oper. Res., 2012)

Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. - Lucas Létocart; Anass Nagih; Nora Touati Moungla (Int. J. Math. Oper. Res., 2012)

Lower bounds for the makespan minimization in job shops. - Yacine Benziani; Imed Kacem; Pierre Laroche; Anass Nagih (ICNSC, 2013)

Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. - Imed Kacem; Anass Nagih; Maryam Seifaddini (ICNSC, 2013)

Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning. - Laurent Alfandari; J. Sadki; Agnès Plateau; Anass Nagih (Comput. Oper. Res., 2013)

Two bounds of chromatic number in graphs coloring problem. - Assia Gueham; Anass Nagih; Hacène Aït Haddadène (CoDIT, 2014)

Synthesis of a dwelling layout as a packing problem using objects of varying sizes. - Y. Bouzoubaa; C. Minich; Anass Nagih; Alain Pruski (CoDIT, 2016)

A Novel Co-evolutionary Approach for Constrained Genetic Algorithms. - Emmanuel Kieffer; Mateusz Guzek; Grégoire Danoy; Pascal Bouvry; Anass Nagih (GECCO (Companion), 2016)

Hybrid mobility model with pheromones for UAV detection task. - Emmanuel Kieffer; Grégoire Danoy; Pascal Bouvry; Anass Nagih (SSCI, 2016)

Bayesian optimization approach of general bi-level problems. - Emmanuel Kieffer; Grégoire Danoy; Pascal Bouvry; Anass Nagih (GECCO (Companion), 2017)

A new Co-evolutionary Algorithm Based on Constraint Decomposition. - Emmanuel Kieffer; Grégoire Danoy; Pascal Bouvry; Anass Nagih (IPDPS Workshops, 2017)

A Competitive Approach for Bi-Level Co-Evolution. - Emmanuel Kieffer; Grégoire Danoy; Pascal Bouvry; Anass Nagih (IPDPS Workshops, 2018)

Graph coloring approach with new upper bounds for the chromatic number: team building application. - Assia Gueham; Anass Nagih; Hacène Aït Haddadène; Malek Masmoudi (RAIRO Oper. Res., 2018)

Contraction-based method for computing a lower bound on the clique number of a graph. - Assia Gueham; Hacène Aït Haddadène; Anass Nagih (CoDIT, 2019)

A new modeling approach for the biobjective exact optimization of satellite payload configuration. - Emmanuel Kieffer; Grégoire Danoy; Pascal Bouvry; Anass Nagih (Int. Trans. Oper. Res., 2019)

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Anass Nagih; Zsuzsanna Róka (Discret. Optim., 2020)

Tackling Large-Scale and Combinatorial Bi-Level Problems With a Genetic Programming Hyper-Heuristic. - Emmanuel Kieffer; Grégoire Danoy; Matthias R. Brust; Pascal Bouvry; Anass Nagih (IEEE Trans. Evol. Comput., 2020)

Bi-objective load balancing multiple allocation hub location: a compromise programming approach. - Rahimeh Neamatian Monemi; Shahin Gelareh; Anass Nagih; Dylan Jones (Ann. Oper. Res., 2021)