Anass Nagih

Publication Activity (10 Years)

Years Active: 1999-2021
Publications (10 Years): 12

Top Topics

Scheduling Problem

Evolutionary Algorithm

Top Venues

GECCO (Companion)

Comput. Oper. Res.

Publications

Rahimeh Neamatian Monemi, Shahin Gelareh, Anass Nagih, Dylan Jones
Bi-objective load balancing multiple allocation hub location: a compromise programming approach. Ann. Oper. Res. 296 (1) (2021)
Emmanuel Kieffer, Grégoire Danoy, Matthias R. Brust, Pascal Bouvry, Anass Nagih
Tackling Large-Scale and Combinatorial Bi-Level Problems With a Genetic Programming Hyper-Heuristic. IEEE Trans. Evol. Comput. 24 (1) (2020)
Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discret. Optim. 35 (2020)
Assia Gueham, Hacène Aït Haddadène, Anass Nagih
Contraction-based method for computing a lower bound on the clique number of a graph. CoDIT (2019)
Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
A new modeling approach for the biobjective exact optimization of satellite payload configuration. Int. Trans. Oper. Res. 26 (1) (2019)
Assia Gueham, Anass Nagih, Hacène Aït Haddadène, Malek Masmoudi
Graph coloring approach with new upper bounds for the chromatic number: team building application. RAIRO Oper. Res. 52 (3) (2018)
Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
A Competitive Approach for Bi-Level Co-Evolution. IPDPS Workshops (2018)
Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
Bayesian optimization approach of general bi-level problems. GECCO (Companion) (2017)
Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
A new Co-evolutionary Algorithm Based on Constraint Decomposition. IPDPS Workshops (2017)
Y. Bouzoubaa, C. Minich, Anass Nagih, A. Pruski
Synthesis of a dwelling layout as a packing problem using objects of varying sizes. CoDIT (2016)
Emmanuel Kieffer, Mateusz Guzek, Grégoire Danoy, Pascal Bouvry, Anass Nagih
A Novel Co-evolutionary Approach for Constrained Genetic Algorithms. GECCO (Companion) (2016)
Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih
Hybrid mobility model with pheromones for UAV detection task. SSCI (2016)
Assia Gueham, Anass Nagih, Hacène Aït Haddadène
Two bounds of chromatic number in graphs coloring problem. CoDIT (2014)
Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih
Lower bounds for the makespan minimization in job shops. ICNSC (2013)
Laurent Alfandari, J. Sadki, Agnès Plateau, Anass Nagih
Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning. Comput. Oper. Res. 40 (8) (2013)
Imed Kacem, Anass Nagih, Maryam Seifaddini
Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. ICNSC (2013)
Lucas Létocart, Anass Nagih, Nora Touati Moungla
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. Int. J. Math. Oper. Res. 4 (3) (2012)
Lucas Létocart, Anass Nagih, Gérard Plateau
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. Comput. Oper. Res. 39 (1) (2012)
Yves Stadler, Yann Lanuel, Anass Nagih, Francine Herrmann
Certification Watermarking for Digital Handheld-captured Photography. PECCS (2011)
Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau
A MIP flow model for crop-rotation planning in a context of forest sustainable development. Ann. Oper. Res. 190 (1) (2011)
Nora Touati Moungla, Lucas Létocart, Anass Nagih
An improving dynamic programming algorithm to solve the shortest path problem with time windows. Electron. Notes Discret. Math. 36 (2010)
Nora Touati Moungla, Lucas Létocart, Anass Nagih
Solutions diversification in a column generation algorithm. Algorithmic Oper. Res. 5 (2) (2010)
Olivier Laval, Sophie Toulouse, Anass Nagih
Rapport de recherche sur le problème du plus court chemin contraint CoRR (2008)
Anass Nagih, François Soumis
Nodal aggregation of resource constraints in a shortest path problem. Eur. J. Oper. Res. 172 (2) (2006)
Babacar Thiongane, Anass Nagih, Gérard Plateau
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem. Discret. Appl. Math. 154 (15) (2006)
Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. CPAIOR (2005)
Babacar Thiongane, Anass Nagih, Gérard Plateau
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual. Ann. Oper. Res. 139 (1) (2005)
Babacar Thiongane, Anass Nagih, Gérard Plateau
Analyse de sensibilité pour les problèmes linéaires en variables 0-1. RAIRO Oper. Res. 37 (4) (2003)
Anass Nagih, Gérard Plateau
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution. RAIRO Oper. Res. 33 (4) (1999)