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

385篇 您的检索式：期刊名="Informs Journal on Computer"

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

	题名	作者	年代	出处	被引量
1	An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem显示文摘	Congram R K Potts C N van de Velde S	2002	Informs Journal on Computing2002，14，：	1
2	An Integer-programming-based Approach to the Close-Enough Traveling Salesman Problem显示文摘	BEHDANI B COLE S J	2014	Informs Journal on Computing2014，26，3：	1
3	Efficient simulation budget alloca- tion for selecting an optimal subset 显示文摘	Chen C H D H He M C Fu L H Lee	2008	INFORMS Journal on Computing2008，，20：	1
4	Approximating shortest paths in large-scale networks with an application to intelligent transportation systems 显示文摘	Chou Y L Romeijn H E Smith R L	1998	INFORMS Journal on Computing1998，10，2：	1
5	Exact and approximate non-deter ministic tree search procedures for the quadratic assignment problem显示文摘	Maniezzo V	1999	INFORMS Journal on computing1999，11，4：	1
6	A powerful genetie algorithm using edge assembly crossover for the traveling salesman problem 显示文摘	Nagata Y Kobayashi $	2013	Informs Journal on Computing2013，25，2：	1
7	The online TSP against fair adversaries显示文摘	Blom M Krumke S De Paepe W	2001	INFORMS Journal on Computing2001，13，2：	1
8	An ant colony system hybridized with a new local search for the sequential ordering problem显示文摘	Gambardella L M Dorigo M	2000	INFORMS Journal on Computing2000，12，3：	1
9	A binary search heuristic algorithm based on randomized local search for the rectangular strip packing problem显示文摘	Zhang D F Wei L J Stephen C H	2013	Informs Journal on Computing2013，25，2：	1
10	A new genetic algorithm for the quadratic assignment problem显示文摘	Drezner Z	2003	Informs Journal on Computing2003，15，3：	1
11	Exact and approximate nondeterrninistie tree- search procedures for the quadratic assignment problem 显示文摘	Maniezzo V	1999	INFORMS Journal on Computing1999，，11：	1
12	The vehicle routing problem with time windows,Part I:Tabu search显示文摘	Potvin J Y Kervahut T Gareau B I Rousseau J M	1996	INFORMS Journal on Computing1996，8，2：	1
13	State-of-the art review evolutionary algorithms for vehicle routing显示文摘	Potvin JY	2009	INFORMS Journal on computing2009，21，4：	1
14	The vehicle routing problem with time windows,Part II:genetic search显示文摘	Potvin J Y Bengio S	1996	Informs Journal on Computing1996，8，2：	1
15	An exact solution approach based on shortest-paths for p-hub median problems显示文摘	ERNST A T KRISHNAMOORTHY M	1998	Informs Journal on Computing1998，10，2：	1
16	A framework for the evaluation of session reconstruction heuristics in Web-usage analysis显示文摘	SPILIOPOULOU M MOBASHER B BERENDT B	2003	INFORMS Journal on Computing2003，15，5：	1
17	Fast algorithms for geometric traveling salesman problems 显示文摘	BENTLEY J L	1992	Informs Journal on Computing1992，4，：	1
18	The Granular Tabu Search and Its Application to the Vehicle-Routing Problem 显示文摘	Paolo Toth Daniele Vigo	2003	INFORMS Journal on Computing (S1091-9856)2003，15，4：	1
19	Solving the generalized assignment problem:an optimizting and heuristic approach显示文摘	Nauss R M	2003	INFORMS Journal on Computing2003，15，3：	1
20	Opportunities for combinatorial optimization in computational biology显示文摘	Greenberg H J Hart W E Lancia G	2004	Informs Journal on Computing2004，14，1：	1

返回顶部每页显示：

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

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

用户提示