default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnass Nagih
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]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): 363-406 (2021)- 2020
- [j15]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: 100551 (2020) - [j14]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): 44-56 (2020)
2010 – 2019
- 2019
- [j13]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): 180-199 (2019) - [c12]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: 1758-1762 - 2018
- [j12]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): 807-818 (2018) - [c11]Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih:
A Competitive Approach for Bi-Level Co-Evolution. IPDPS Workshops 2018: 609-618 - 2017
- [c10]Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih:
Bayesian optimization approach of general bi-level problems. GECCO (Companion) 2017: 1614-1621 - [c9]Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih:
A new Co-evolutionary Algorithm Based on Constraint Decomposition. IPDPS Workshops 2017: 492-500 - 2016
- [c8]Y. Bouzoubaa, C. Minich, Anass Nagih, Alain Pruski:
Synthesis of a dwelling layout as a packing problem using objects of varying sizes. CoDIT 2016: 758-762 - [c7]Emmanuel Kieffer, Mateusz Guzek, Grégoire Danoy, Pascal Bouvry, Anass Nagih:
A Novel Co-evolutionary Approach for Constrained Genetic Algorithms. GECCO (Companion) 2016: 47-48 - [c6]Emmanuel Kieffer, Grégoire Danoy, Pascal Bouvry, Anass Nagih:
Hybrid mobility model with pheromones for UAV detection task. SSCI 2016: 1-8 - 2014
- [c5]Assia Gueham, Anass Nagih, Hacène Aït Haddadène:
Two bounds of chromatic number in graphs coloring problem. CoDIT 2014: 292-296 - 2013
- [j11]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): 1938-1946 (2013) - [c4]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: 388-391 - [c3]Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih:
Lower bounds for the makespan minimization in job shops. ICNSC 2013: 442-445 - 2012
- [j10]Lucas Létocart, Anass Nagih, Gérard Plateau:
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. Comput. Oper. Res. 39(1): 12-18 (2012) - [j9]Lucas Létocart, Anass Nagih, Nora Touati Moungla:
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. Int. J. Math. Oper. Res. 4(3): 247-262 (2012) - 2011
- [j8]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): 149-164 (2011) - [c2]Yves Stadler, Yann Lanuel, Anass Nagih, Francine Herrmann:
Certification Watermarking for Digital Handheld-captured Photography. PECCS 2011: 527-534 - 2010
- [j7]Nora Touati Moungla, Lucas Létocart, Anass Nagih:
Solutions diversification in a column generation algorithm. Algorithmic Oper. Res. 5(2): 86-95 (2010) - [j6]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: 931-938 (2010)
2000 – 2009
- 2008
- [i1]Olivier Laval, Sophie Toulouse, Anass Nagih:
Rapport de recherche sur le problème du plus court chemin contraint. CoRR abs/0803.2615 (2008) - 2006
- [j5]Babacar Thiongane, Anass Nagih, Gérard Plateau:
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem. Discret. Appl. Math. 154(15): 2200-2211 (2006) - [j4]Anass Nagih, François Soumis:
Nodal aggregation of resource constraints in a shortest path problem. Eur. J. Oper. Res. 172(2): 500-514 (2006) - 2005
- [j3]Babacar Thiongane, Anass Nagih, Gérard Plateau:
An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual. Ann. Oper. Res. 139(1): 353-373 (2005) - [c1]Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih:
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. CPAIOR 2005: 258-272 - 2003
- [j2]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): 291-309 (2003)
1990 – 1999
- 1999
- [j1]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): 383-419 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
