( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem.

, , , и . Int. J. Artif. Intell. Tools, 28 (7): 1950024:1-1950024:17 (2019)

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.

Lucet Vial

Corinne Kaiser

Corinne Neudorfer

Corinne Rose

Corinne Vannier

 

Другие публикации лиц с тем же именем

Sum Coloring : New upper bounds for the chromatic strength., , и . CoRR, (2016)An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem., , , и . Int. J. Artif. Intell. Tools, 28 (7): 1950024:1-1950024:17 (2019)Resolving the Network Reliability Problem with a Tree Decomposition of the Graph., и . OPODIS, стр. 193-204. Hermes, (1997)Adaptative Local Search for a Pickup and Delivery Problem Applied to Large Parcel Distribution., , и . OLA, том 1824 из Communications in Computer and Information Science, стр. 186-199. Springer, (2023)A Memetic Algorithm for staff scheduling problem in airport security service., , , и . Expert Syst. Appl., 40 (18): 7504-7512 (2013)Minimum sum coloring problem: Upper bounds for the chromatic strength., , и . Discret. Appl. Math., (2017)A BDD-Based Heuristic Algorithm for Design of Reliable Networks with Minimal Cost., , и . MSN, том 4325 из Lecture Notes in Computer Science, стр. 244-255. Springer, (2006)A Decomposition Algorithm for Network Reliability Evaluation., и . Discret. Appl. Math., 65 (1-3): 141-156 (1996)An exact method for graph coloring., , и . Comput. Oper. Res., (2006)Lower Bounds for the Minimal Sum Coloring Problem., , , и . Electron. Notes Discret. Math., (2010)