( en | de | ru )

 

Disambiguation of "Nagih, Anass"

Author of the publication

copydeleteadd this publication to your clipboard
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution.

, and . RAIRO Oper. Res., 33 (4): 383-419 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anass Lasram

Anass Nouri

Anass Bellachehab

Anass Aïssi

Nagih Ali Al-Obaidi

 

Other publications of authors with the same name

Contraction-based method for computing a lower bound on the clique number of a graph., , and . CoDIT, page 1758-1762. IEEE, (2019)A MIP flow model for crop-rotation planning in a context of forest sustainable development., , , and . Ann. Oper. Res., 190 (1): 149-164 (2011)Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval., , and . ICNSC, page 388-391. IEEE, (2013)Synthesis of a dwelling layout as a packing problem using objects of varying sizes., , , and . CoDIT, page 758-762. IEEE, (2016)Rapport de recherche sur le problème du plus court chemin contraint, , and . CoRR, (2008)Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut., , , , and . Discret. Optim., (2020)An improving dynamic programming algorithm to solve the shortest path problem with time windows., , and . Electron. Notes Discret. Math., (2010)Nodal aggregation of resource constraints in a shortest path problem., and . Eur. J. Oper. Res., 172 (2): 500-514 (2006)Analyse de sensibilité pour les problèmes linéaires en variables 0-1., , and . RAIRO Oper. Res., 37 (4): 291-309 (2003)Two bounds of chromatic number in graphs coloring problem., , and . CoDIT, page 292-296. IEEE, (2014)