机译:基于LP的启发式节点容量树内打包算法。
Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;
Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;
Department of Information Systems and Mathematical Sciences, Faculty of Information Sciences and Engineering, Nanzan University, 27 Seirei, Seto, Aichi 489-0863, Japan;
Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;
wireless ad hoc network; sensor network; LP relaxation; column generation; relaxation heuristics;
机译:节点限制的树内打包问题的复杂性
机译:三个目标电容车辆路径问题的两相LP基于三相启发式方法的性能比较
机译:基于LP的启发式方法解决了容量分配问题
机译:在基于LP的启发式算法中使用有效不等式和不同网格来包装圆形对象
机译:基于装箱启发法的输液椅调度算法
机译:基于PSO-TS算法的可持续城市固体废物收集管理车辆容量问题的优化
机译:基于Lp的节点容纳树内装箱问题启发式算法