Anass Nagih

According to our database, Anass Nagih authored at least 29 papers between 1999 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

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

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

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

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

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

Proceedings of the 6th International Conference on Control, 2019

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

A Competitive Approach for Bi-Level Co-Evolution.

Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

2017

A new Co-evolutionary Algorithm Based on Constraint Decomposition.

Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Bayesian optimization approach of general bi-level problems.

Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Hybrid mobility model with pheromones for UAV detection task.

Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih

Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

A Novel Co-evolutionary Approach for Constrained Genetic Algorithms.

Emmanuel Kieffer, Mateusz Guzek, Grégoire Danoy, Pascal Bouvry, Anass Nagih

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Synthesis of a dwelling layout as a packing problem using objects of varying sizes.

Y. Bouzoubaa, C. Minich, Anass Nagih, A. Pruski

Proceedings of the International Conference on Control, 2016

2014

Two bounds of chromatic number in graphs coloring problem.

Assia Gueham, Anass Nagih, Hacène Aït Haddadène

Proceedings of the International Conference on Control, 2014

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

Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval.

Imed Kacem, Anass Nagih, Maryam Seifaddini

Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013

Lower bounds for the makespan minimization in job shops.

Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih

Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013

2012

Dantzig-Wolfe and Lagrangian decompositions in integer linear programming.

Lucas Létocart, Anass Nagih, Nora Touati Moungla

Int. J. Math. Oper. Res., 2012

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem.

Lucas Létocart, Anass Nagih, Gérard Plateau

Comput. Oper. Res., 2012

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

Certification Watermarking for Digital Handheld-captured Photography.

Yves Stadler, Yann Lanuel, Anass Nagih, Francine Herrmann

Proceedings of the PECCS 2011, 2011

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

Solutions diversification in a column generation algorithm.

Nora Touati Moungla, Lucas Létocart, Anass Nagih

Algorithmic Oper. Res., 2010

2008

Rapport de recherche sur le problème du plus court chemin contraint

Olivier Laval, Sophie Toulouse, Anass Nagih

CoRR, 2008

2006

Nodal aggregation of resource constraints in a shortest path problem.

Anass Nagih, François Soumis

Eur. J. Oper. Res., 2006

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.

Babacar Thiongane, Anass Nagih, Gérard Plateau

Discret. Appl. Math., 2006

2005

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual.

Babacar Thiongane, Anass Nagih, Gérard Plateau

Ann. Oper. Res., 2005

Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs.

Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

2003

Analyse de sensibilité pour les problèmes linéaires en variables 0-1.

Babacar Thiongane, Anass Nagih, Gérard Plateau

RAIRO Oper. Res., 2003

1999

Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution.

Anass Nagih, Gérard Plateau

RAIRO Oper. Res., 1999