Period of time： 2014年1期
Publisher： Springer Publishing Company
Founded in： 1997
Total resources： 39
ISSN： 1382-6905
Subject： O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Combinatorial Optimization,volume 8,issue 1
Menu
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem
By Kellerer Hans,Pferschy Ulrich in (2004)
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.
Access to resources
Recommend
Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints
By Gladky A.A.,Shafransky Y.M.,Strusevich V.A. in (2004)
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.Constructing the Maximum Consensus Tree from Rooted Triples
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.Two Novel Evolutionary Formulations of the Graph Coloring Problem
By Barbosa Valmir C.,Assis Carlos A.G.,Do Nascimento Josina O. in (2004)
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
By Chen Bo,Deng Xiaotie,Zang Wenan in (2004)
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.Algorithm for the Cost Edge-Coloring of Trees
By Zhou Xiao,Nishizeki Takao in (2004)
Journal of Combinatorial Optimization,volume 8,issue 1 , Vol. 8, Iss. 1, 2004-03 , pp.