Anass Nagih

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