Zhang X.Application of DNA Self-Assembly on Graph Coloring Problem. Journal of Computational and Theoretical Nanoscience . 2009Zhang, Xuncai,Niu, Ying,Cui, Guangzhao,Xu, Jin.Application of DNA self-assembly on 0-1 integer programming problem. Journal of Computational and Theoretical Nanoscience . ...
IntegerProgramming)或称之为全整数规划 (AllIntegerProgramming);如果只有部 分决策变量要求是整数,其它变量则不予限 制,这样的问题称之为混合整数规划(Mixed IntegerProgramming)。整数规划还有一种特 殊的形式,就是整数变量的取值仅限于0或1 ,这样的问题我们称之为0-1整数规划(0-1 IntegerProgramming)。 本章内...
:非线性01整数规划)In POTAM, we exploit a parallel multi-block Alternating Direction Method of Multipliers (ADMM) based method to model both requirements of delay and energy consumptions, which formulates the task allocation under these requirements as a nonlinear 0–1 integer programming problem. ...
关键词 整数规划;0-1整数规划;枚举法;组合直 2、接搜寻法Abstract0-1 integer linear programming plays an important role in integer programming. In many practical problems, such as assignment problem, site selection problem and deliver goods problem, they are all boiled down to 0-1 integer linear ...
有的变量限制其取值只能为0或1,这类特殊的整数规划称为0-1规划(0-1IntegerProgramming)。 整数规划的有关概念 一、整数规划问题 例4.1某工厂生产甲、乙两种设备,已知生产这两种设备需要消耗材料A、材料B,有关数据如下,问这两种设备各生产多少使工厂利润最大?
1. By modeling,the authors transform the original exploration problem to a nonlinear0-1 mixed integer programming problem. 本文探讨了一类N车探险问题的近似算法,首先通过建模将N车问题转变为一个等价的非线性0-1混合整数规划问题,进而将该非线性0-1混合整数规划问题转化为一个一般的带约束非线性规划问题,并...
(2001). Pivot, cut, and dive: A heuristic for mixed 0-1 integer programming (Tech. Rep. RUTCOR Research Report RRR 53-2001). Rutgers University, Newark, New Jersey.J. Eckstein and M. Nediak (2007) "Pivot, Cut and Dive: a Heuristic for Mixed 0-1 Integer Programming," Journal of ...
Best-first and/or search for 0-1 integer programming - Marinescu, Dechter - 2007 () Citation Context ...ical models are discussed by Marinescu and Dechter (2007b, 2006). AND/OR search spaces are also used for solving mixed integer linear programming (Marinescu & Dechter, 2005), 0/1 ...
特殊0-1整数规划问题的DNA芯片模型研究 Research on DNA chip model of special 0-1 integer programming problem 答辩人:朱建鹏 指导教师:殷志祥教授 目录 CONTENTS 1 DNA计算的研究背景及现状 2 基础知识和原理 3 研究过程及方法 4 实例及复杂度分析 5 模型推广及算法改进 6 总结 1 DNA计算的研究背景及现状 ...
0-1混合整数规划模型 1. Reverse logistics network design problem was formulated as a 0-1 mixed-integer programming model and was designed to minimize the total reverse logistics cost,and to pay a. 以总逆向物流成本最小为目标,兼顾各客户群的产品回收便利性,建立了0-1混合整数规划模型,实现逆向物流...