维普期刊资源整合服务平台（V6.5）

36篇 您的检索式：作者名="LACOMME P"

选中清除导出查看参考文献查看引证文献引用追踪共2页首页上一页第1页下一页末页 /2 跳转

	题名	作者	年代	出处	被引量
1	Competitivememetic algorithms for routing problem 显示文摘	LACOMME P PRINS C RAMDANE - CHERIF W	2004	Annals of OperationsResearch2004，131，1：	1
2	Competitive memetic algorithms for arc routing problems 显示文摘	Lacomme P Prins C Ramdane-Cherif W	2004	Annals of Operations Research2004，131，：	1
3	Competitive memetic algorithms for arc routing problems 显示文摘	Lacomme P Prins C Ramdane - Cherif W	2004	Annals of Operations Research2004，131，14：	1
4	Job-shop basedframework for simultaneous scheduling of machines andautomated guided vehicles 显示文摘	Lacomme P Larabi M Tchemev N	2013	International Journal ofProduction Economics2013，143，1：	1
5	Lower and up-per bounds for the mixed capacitated arc routing problem 显示文摘	BELENGUER J K BENAVENT E LACOMME P	2006	Computers and Operations Research2006，33，12：	1
6	Competi- tive memetic algorithms for are routing problems显示文摘	Lacomme P Prins C Ramdane-Cherif W	2004	Annals of Operations Research2004，131，1：	1
7	Competitive memetic algorithms for arc routing problems显示文摘	Lacomme P Prins C Ramdane-Cherif W	2004	Annals of Operations Research2004，131，14：	1
8	Competitive memetic algorithms for arc routing problems显示文摘	Lacomme P Prins C Ramdane-Cherif W	2004	Annals of Operations Research2004，131，：	1
9	Efficient frameworks for greedy split and new depth first search split procedures for routing problems显示文摘	Duhamel C Lacomme P Prodhon C	2011	Computers and Operations Research2011，38，4：	1
10	Competitive Memetic Algorithms for Routing Problem显示文摘	Lacomme P Prins C Ramdane-Cherif W		0，，01：	1
11	Lower and upper bounds for the mixed capacitated arc routing problem显示文摘	BELEGGUER J M BENAVENT E LACOMME P	2006	Computers & Operations Research2006，，33：	1
12	Efficient frameworks for greedy split and new depth first search split procedures for routing problems显示文摘	Duhamel C Lacomme P Prodhon C	2011	Computers and Operations Research2011，38，4：	1
13	Clinical charac- teristics and management of iron overload in 631 patients with chronic transfusion dependency: results from a muhicentre, observational study 显示文摘	Kemmoe S Lacomme P Tchernev N	2013	Blood transfusion = Trasfusione del sangue2013，121，1：	1
14	An MILP for scheduling problems in an FMS with one vehicle 显示文摘	Caumond A Lacomme P Moukrim A	2009	European Journal of Operational Re- search2009，199，3：	1
15	Competitive memetic algorithms for arc routing problems显示文摘	LACOMME P PRINS C RAMDANE - CHERIF W	2004	Annals of Operations Research2004，131，：	1
16	Competitive Memetic Algorithms for Arc Routing Problems显示文摘	Lacomme P Prins C Ramdane C W	2004	Annals of Operations Research2004，131，1：	1
17	Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system:a heuristic branch-and-bound approach coupled with a discrete events simulation model显示文摘	Lacomme P Moukrim A Tchernev N	2005	International Journal of Production Research (S0020-7543)2005，43，9：	1
18	Efficientframeworks for greedy split and new depth first searchsplit procedures for routing problems 显示文摘	DUHAMEL C LACOMME P PRODHON C	2011	Computers andOperations Research2011，38，4：	1
19	Lower and upper bounds for the mixed capacitated arc routing problem显示文摘	BELENGUER J M BENAVENT E LACOMME P	2006	Computers and Operations Research2006，33，12：	1
20	Competitive memetic algorithm for are routing problems显示文摘	Lacomme P Prins C Ramdane-Cherif W	2004	Annals of Operations Research2004，，131：	1

返回顶部每页显示：

共2页首页上一页第1页下一页末页 /2 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示