In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are present...Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.展开更多
Hyperactivation of DNA repairing pathway is highly associated with the chemosensitivity and chemoresistance of cancer cells.In this manuscript,guided by cascaded one strain many compounds-global natural products socia...Hyperactivation of DNA repairing pathway is highly associated with the chemosensitivity and chemoresistance of cancer cells.In this manuscript,guided by cascaded one strain many compounds-global natural products social molecular networking(OSMAC-GNPS)strategy,a pair of epimeric environmental-induced metabolites were isolated from Aspergillus sp.EGF 15-0-3.Structurally,sterpiperazines A(1)and B(2)represent the first steroid-based indole alkaloids with unprecedented backbones.Biologically,compound 1 could be identified as a novel tyrosyl-DNA phosphodiesterase 1(Tdp1)inhibitor with a unique mechanism distinct from the reported modulators,and was able to significantly enhance the sensitivity of NCI-H460 cells to the clinic chemotherapeutic drug through inhibiting the DNA repairment and enhanced the DNA damage of cancer cells.展开更多
It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 progra...It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.展开更多
0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. The...0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.展开更多
文摘In this paper,quadratic 0-1 programming problem (I) is considered, in terms of its features quadratic 0-1 programming problem is solved by linear approxity heurstic algrothm and a developed tabu search ahgrothm .
文摘Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.
基金supported by the National Natural Science Foundation of China(Nos.82273845,82304331,and 82360695)Guangxi Natural Science Foundation project(No.2023GXNSFBA026305).
文摘Hyperactivation of DNA repairing pathway is highly associated with the chemosensitivity and chemoresistance of cancer cells.In this manuscript,guided by cascaded one strain many compounds-global natural products social molecular networking(OSMAC-GNPS)strategy,a pair of epimeric environmental-induced metabolites were isolated from Aspergillus sp.EGF 15-0-3.Structurally,sterpiperazines A(1)and B(2)represent the first steroid-based indole alkaloids with unprecedented backbones.Biologically,compound 1 could be identified as a novel tyrosyl-DNA phosphodiesterase 1(Tdp1)inhibitor with a unique mechanism distinct from the reported modulators,and was able to significantly enhance the sensitivity of NCI-H460 cells to the clinic chemotherapeutic drug through inhibiting the DNA repairment and enhanced the DNA damage of cancer cells.
基金supported by National Natural Science Foundation of China (Grant Nos.70471008, 70971072)
文摘It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.
基金This project was supported by the National Natural Science Foundation of China (79970042).
文摘0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.
