期刊文献+
共找到14篇文章
< 1 >
每页显示 20 50 100
A Tabu Search Algorithm for Quadratic 0-1 Programming Problem 被引量:2
1
作者 周贤伟 王远允 +1 位作者 田新现 郭瑞强 《Chinese Quarterly Journal of Mathematics》 CSCD 1997年第4期98-102, ,共5页
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 .
关键词 Tabu search linear approximate quaratic 0-1 programming
下载PDF
Global optimality conditions for quadratic 0-1 programming with inequality constraints 被引量:1
2
作者 张连生 陈伟 姚奕荣 《Journal of Shanghai University(English Edition)》 CAS 2010年第2期150-154,共5页
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. 展开更多
关键词 quadratic 0-1 programming optimality condition nonconvex optimization integer programming convex duality
下载PDF
A Hybrid Dynamic Programming Method for Concave Resource Allocation Problems
3
作者 姜计荣 孙小玲 《Journal of Shanghai University(English Edition)》 CAS 2005年第2期95-98,共4页
Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems a... Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems are encountered in optimization models involving economies of scale. In this paper, a new hybrid dynamic programming method was proposed for solving concave resource allocation problems. A convex underestimating function was used to approximate the objective function and the resulting convex subproblem was solved with dynamic programming technique after transforming it into a 0-1 linear knapsack problem. To ensure the convergence, monotonicity and domain cut technique was employed to remove certain integer boxes and partition the revised domain into a union of integer boxes. Computational results were given to show the efficiency of the algorithm. 展开更多
关键词 nonlinear integer programming resource allocation linear underestimation 0-1linearization dynamic programming.
下载PDF
Nonconvex Quadratic Programming Method for k-Coloring Problem:Algorithm and Computation
4
作者 Cao Jiaming(Department of Transportation Engineering) ,Southwest Jiaotong University,Chengdu 610031, China 《Journal of Modern Transportation》 1994年第2期138-145,共8页
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above... In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported. 展开更多
关键词 k-coloring problem quadratic 0-1 programming relaxed equivalence nonconvex quadratic programming linear programming approximatealgorithm
下载PDF
A class of polynomially solvable 0-1 programming problems and an application
5
作者 Wang Miao Xie JinXing Xiong HuaChun 《Science China Mathematics》 SCIE 2011年第3期623-632,共10页
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 polynomial-time algorithms supply chain management
原文传递
Compact Model for the Obnoxious <i>p</i>-Median Problem 被引量:2
6
作者 Yen-I Chiang Chang-Chun Lin 《American Journal of Operations Research》 2017年第6期348-355,共8页
Obnoxious facilities are those crucial to human living, yet antagonistic to the public or environment. However, the interactions between obnoxious facilities and their clients have been less frequently investigated. A... Obnoxious facilities are those crucial to human living, yet antagonistic to the public or environment. However, the interactions between obnoxious facilities and their clients have been less frequently investigated. A state-of-the-art model for this problem involves numerous 0 - 1 variables, rendering it difficult to solve. This study aims at removing most of these 0 - 1 variables to enhanced model efficiency. A compact model is presented in this study, with the equivalence between the new and original models proved. Additionally, numerical tests were conducted to show that the proposed compact model is more efficient than the original one. 展开更多
关键词 FACILITY LOCATION Obnoxious FACILITY 0 - 1 programming FACILITY DISPERSION
下载PDF
Recent Advances in Mathematical Programming with Semi-continuous Variables and Cardinality Constraint 被引量:3
7
作者 Xiaoling Sun Xiaojin Zheng Duan Li 《Journal of the Operations Research Society of China》 EI 2013年第1期55-77,共23页
Mathematical programming problems with semi-continuous variables and cardinality constraint have many applications,including production planning,portfolio selection,compressed sensing and subset selection in regressio... Mathematical programming problems with semi-continuous variables and cardinality constraint have many applications,including production planning,portfolio selection,compressed sensing and subset selection in regression.This class of problems can be modeled as mixed-integer programs with special structures and are in general NP-hard.In the past few years,based on new reformulations,approximation and relaxation techniques,promising exact and approximate methods have been developed.We survey in this paper these recent developments for this challenging class of mathematical programming problems. 展开更多
关键词 Semi-continuous variables Cardinality and sparsity constraint Mixed-integer 0-1 quadratic programming Perspective reformulation Lagrangian decomposition Approximate methods
原文传递
A NEW ALGORITHM FOR PURX O-1 LINEAR PROGRAMS WITH INEQUALITY CONSTRAINTS
8
作者 CHEN Jianfei(Biochemical Engineering State Key Laboratory,Beijing 100080,China)XIA Shaowei(Department of Automation, Tsinghua University, Beijing 100084,China) 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1996年第1期50-54,共5页
ANEWALGORITHMFORPURXO-1LINEARPROGRAMSWITHINEQUALITYCONSTRAINTS¥CHENJianfei(BiochemicalEngineeringStateKeyLab... ANEWALGORITHMFORPURXO-1LINEARPROGRAMSWITHINEQUALITYCONSTRAINTS¥CHENJianfei(BiochemicalEngineeringStateKeyLaboratory,Beijing10... 展开更多
关键词 NEURAL network PURE 0-1 linear program near-optimal solution SIMPLEX algorithm.
原文传递
Weekly Fleet Assignment Model and Algorithm 被引量:1
9
作者 朱星辉 朱金福 巩在武 《Journal of Southwest Jiaotong University(English Edition)》 2007年第3期231-235,共5页
A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet... A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ¥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline. 展开更多
关键词 Flight scheduling Fleet assignment problem 0-1 Integer programming model Branch-and-bound algorithm
下载PDF
Economical Analysis and Optimization of Recovery Processing Policies about Discarded Product 被引量:1
10
作者 XieJiaping KongLingcheng ChenRongqiu 《Ecological Economy》 2005年第2期44-51,共8页
On the foundation of analyzing the closed loop logistics chain of product with multi-lifecycle, the connotation of environmental value is set forth, recurring to such conceptions as supply chain and value chain. The p... On the foundation of analyzing the closed loop logistics chain of product with multi-lifecycle, the connotation of environmental value is set forth, recurring to such conceptions as supply chain and value chain. The plotting rules about disassembly tree are discussed in detail. The reachable matrix R of components’ disas- sembly is introduced into distinguishing if disassembly is needed, in combination with disassembly-deciding vector X. Furthermore, the arithmetic of disassembly cost is put forward. And the cost-benefits of components’ reusing, materials’ recycling, safety disposing are dissertated based on the activity-based costing. Then the 0-1 goal-programming model on product recovery processing is established, with components’ demotion calculated. In addition, taking the PC’s recovery processing for example, we put it into application. 展开更多
关键词 discarded product DISASSEMBLY RECOVERY 0-1 programming goal programming.
下载PDF
Robust Optimization of Performance Scheduling Problem under Accepting Strategy
11
作者 Hui Ding Yuqiang Fan Weiya Zhong 《Open Journal of Optimization》 2018年第4期65-78,共14页
In this paper, the problem of program performance scheduling with accepting strategy is studied. Considering the uncertainty of actual situation, the duration of a program is expressed as a bounded interval. Firstly, ... In this paper, the problem of program performance scheduling with accepting strategy is studied. Considering the uncertainty of actual situation, the duration of a program is expressed as a bounded interval. Firstly, we decide which programs are accepted. Secondly, the risk preference coefficient of the decision maker is introduced. Thirdly, the min-max robust optimization model of the uncertain program show scheduling is built to minimize the performance cost and determine the sequence of these programs. Based on the above model, an effective algorithm for the original problem is proposed. The computational experiment shows that the performance’s cost (revenue) will increase (decrease) with decision maker’s risk aversion. 展开更多
关键词 PERFORMANCE SCHEDULING Robust Optimization DUALITY Theory 0 - 1 MIXED Linear programming
下载PDF
A Simulated Annealing Approach tothe Train Routing and Makeup
12
作者 Lin Boliang(Department of Transportation Engineering,Southwest Jiaotong University,)Chengdu 6 1 003 1, China 《Journal of Modern Transportation》 1994年第1期49-56,共8页
This paper presents the formulation and solution of a train routing and makeupmodel.This formulation results in a large scale 0-1 integer programmingproblem with nonlinear objective function, and linear and nonlinearc... This paper presents the formulation and solution of a train routing and makeupmodel.This formulation results in a large scale 0-1 integer programmingproblem with nonlinear objective function, and linear and nonlinearcoastraints. We know this problem is NP-complete;hence,it is diffieult to solvefor a globelly optimal solution. In this paper we propose a simulated annealingalgorithm for the train routing and makeup problem. This method avoidsentrapment in the local minima of the objective function. The effectiveness ofthis approach has been demonstrasted by results from test casee, 展开更多
关键词 simulated annealing freight train makeup plan train routing nonlinear 0-1programming
下载PDF
Optimized Three-Stage Strategy of Orderly Management of File Stream in Network Printing Workflow
13
作者 Yanling LIAO Xinguang LV 《Journal of Systems Science and Information》 CSCD 2017年第1期74-87,共14页
This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which s... This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which set quick-type, general-type, stable-type and comprehensive-type preflight scheme for customers by investigating the possibility of occurrence of errors of various preflight entries and customer relevancy. Based on four types of preflight schemes, four customer preflight applications were created by using Pitstop Pro and Connector You. Customers can select one of the appropriate applications for quick preflight before delivering to reduce the probability of returning the files back for correction when errors occur in preflight. Second stage is printing enterprise prepress preflight,which proposed the concept of the prepress preflight tolerance. In addition, according to the different requirements of printing technology and quality, this paper established the prepress preflight scheme based on the printing enterprises’ tolerance for preflight error. Third stage is to manage the optimized sorting of prepress file stream. To achieve it, the SPT rule and the 0-1 programming model were adopted, time spend of preflight, printing process and post-press finishing was also taken into account.Moreover, Enfocus Switch software was applied to establish automated network printing workflow and complete the file stream sorting. Finally, the result of simulation analysis of the optimized strategy shows that the optimized three-stage strategy can effectively shorten the file processing time. 展开更多
关键词 customer preflight prepress preflight tolerance SPT rule 0-1 programming model
原文传递
Logistics Network Design for Manufacturing Enterprises with Component Processing Workshops
14
作者 DING Yizhong Logistics Research Center,Shanghai Maritime University,Shanghai 200135,China 《Wuhan University Journal of Natural Sciences》 CAS 2010年第6期516-520,共5页
Logistics network design influences the efficiency and cost of Logistics directly.Some manufacturing enterprises not only have warehouse hubs,but also build component processing workshops which are usually located in ... Logistics network design influences the efficiency and cost of Logistics directly.Some manufacturing enterprises not only have warehouse hubs,but also build component processing workshops which are usually located in those places where the costs of materials and workforce are lower.This paper establishes a logistics network design model for the manufacturing enterprises with component processing workshops based on 0-1 mixture integer programming.The model optimizes the logistics network in an integrated view,by which the selection of the nodes,the manufacturing plan,and transportation plan can be obtained.An example is given to verify its feasibility.The approach is helpful for designing of the logistics network in manufacturing enterprises. 展开更多
关键词 manufacturing enterprise logistics network component processing 0-1 mixture integer programming
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部