机译:很容易说他们很难,但很难看到他们很容易朝着易于的多目标组合优化问题的分类
CEG-IST Instituto Superior Tecnico Universidade de Lisboa;
CISUC Department of Informatics Engineering University of Coimbra;
Mathematical Institute University of Koblenz-Landau;
School of Mathematics and Natural Sciences University of Wuppertal;
CISUC Department of Informatics Engineering University of Coimbra;
Mathematical Institute University of Koblenz-Landau;
School of Mathematics and Natural Sciences University of Wuppertal;
School of Mathematics and Natural Sciences University of Wuppertal;
Mathematical Institute University of Koblenz-Landau;
Multiobjective combinatorial optimization; Tractability; Complexity theory; Bottleneck objective; Binary coefficients; Dynamic programming;
机译:很容易说他们很难,但很难看到他们很容易朝着易于的多目标组合优化问题的分类
机译:B.Korte和J.Vygen算法与组合的组合优化21,Springer Verlag,2012 678页,HARDCOVER平装本$ 45.00,精装本$ 55.00
机译:具有非β-内酰胺酶介导的β-内酰胺抗性的流感嗜血杆菌:易于发现但难以归类
机译:NP-hard优化问题的固定参数可牵引性和逼近性
机译:NP硬度和一些组合优化问题的逼近性。
机译:具有非β-内酰胺酶介导的β-内酰胺抗性的流感嗜血杆菌:易于发现但难以归类
机译:组合搜索简易易用模式的新视角 困难