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

59篇 您的检索式：期刊名="Discrete Optim"

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

	题名	作者	年代	出处	被引量
1	A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem显示文摘	Ntene N Van Vuuren J H	2009	Discrete Optimization2009，6，2：	1
2	Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic pro- grams 显示文摘	ADAMS W P Forrester R J Glover F W	2004	Discrete Optimization2004，1，2：	1
3	A max flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) 显示文摘	ENDRE B HAMMER P L SUN R	2008	Discrete Optimization2008，5，2：	1
4	The inverse {0,1 t-knapsack prob- lem : theory, algorithms and computational experiments 显示文摘	Julien R Jose R F Yves D S	2013	Discrete Optimization2013，0，2：	1
5	Strong polynomiality of resource constraint propagation显示文摘	MERCIER L HENTENRYCK P V	2007	Discrete Optimization2007，4，34：	1
6	Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements显示文摘	Hardin J R Nemhauser G L	2008	Discrete Optimization2008，5，1：	1
7	New algorithms for convex cost tension problem with application to computer vision显示文摘	Kolmogorov V Shioura A	2009	Discrete Optim2009，，6：	1
8	Strong polynomiality of resource constraint propagation显示文摘	Mercier L van Hentenryck P	2007	Discrete Optimization2007，4，34：	1
9	The inverse 0-1 knapsack problem :Theory ,algorithms and computational experi- ments 显示文摘	JULIEN R JOSI RUI FIGUEIRA YVES D S	2013	Discrete Optimization2013，10，2：	1
10	Graph coloring problems显示文摘	JENSEN T R and TOFT B	1995	Wiley-Interscience Series in Discrete Mathematics and Optimization1995，113，2：	1
11	The two-dimensional bin packing problem with variable bin sizes and costs显示文摘	Pisinger Sigurd Sigurd Mikkel	2005	Discrete Optimization2005，2，2：	1
12	The Two-dimensional Bin Packing Problem with Variable Bin Sizes and Costs显示文摘	Pisinger David Siqurd Mikkel	2005	Discrete Optimization2005，2，2：	1
13	The inverse {0, 1}- knapsack problem: theory, algorithms and computational experiments显示文摘	Julien R Jose R F Yves D S	2013	Discrete Optimization2013，10，2：	1
14	On the approximability of influence in social networks显示文摘	Chen N	2009	Journal of Discrete Optimization2009，23，3：	1
15	On shortest disjoint paths in planar graphs显示文摘	Kobayashi Y Sommer C	2010	Discrete Optimization2010，7，4：	1
16	An improved algorithm for computing Steiner minimal trees in Euclidean d-space显示文摘	Marcia F kurt M A	2008	Discrete Optimization2008，5，2：	1
17	A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times显示文摘	Allahverdi A Al-Anzi	2007	European Journal of Operational Research(Discrete Optimization)2007，182，1：	1
18	Fair cost allocations under conflicts-a game-theoretic point of view显示文摘	OkamotoY		Discrete Optimization0，5，1：	1
19	Algorithms for time- dependent bicriteria shortest path problems 显示文摘	Hamacher H W Ruzika S Tjandra S A	2006	Discrete Optimization2006，3，3：	1
20	Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints显示文摘	Righini G Salani M	2006	Discrete Optimization2006，3，3：	1

返回顶部每页显示：

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

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

用户提示