Consider the zero-one linear programming problem $$ {ext{maximize}}\\;Z = \\sum\\limits_{{j = 1}}^{n} {{{c}_{j}}{{x}_{j}}} $$ $$ subject{\\mkern 1mu} to\\;\\sum\\limits_{{j = 1}}^{n} {{{a}_{{ij}}}{{x}_{j}}{{b}_{i}}\\left( {i = 1,2, \\...
zeroOneLinearProgramming.zip泪目**泪目 上传25.85 MB 文件格式 zip metaheuristics multidimensional-knapsack-problem operations-research 元启发式算法求解0-1线性整数规划问题 点赞(0) 踩踩(0) 反馈 所需:1 积分 电信网络下载 学成教育 2025-03-17 01:00:17 积分:1 管道 2025-03-17 00:57:21 积分:...
zero one law 零一律 zero one distribution 零一分布 Kolmogorov s zero one law 柯尔莫哥罗夫零-壹定律 integer programming 整数规划,整体程序设计 integer linear programming 整数线性规划 integer programming problem 整数规划问题 integer programming (IP) 【化】 整数规划 mixed integer programming 混...
This paper presents a zero-one goal programming model for capital budgeting in a property and liability insurance company. The model structure allows for the inclusion of multiple goals, indivisible projects and a multiple period planning horizon. The model offers an advantage of being closer to rea...
While research has tackled the hub-and-spoke network design problem, that research has overlooked the air-truck modal integration issue which is a common feature of real express delivery systems. This paper devises integer linear programs to represent the mode and route assignment aspects of the ...
A zero-one linear goal programming algorithm using Archimedean weights This paper describes a technique for assigning orders against specific reels of inventoried cable to ensure a high level of customer service, efficient lab... D Butler,N Garrod 被引量: 0发表: 1990年 Computational aspects of a...
Zero-one integer programming (which can also be written as '0-1' integer programming) is a mathematical method of using a series of binary functions; in particular, yes ('1') and no ('0') answers to arrive at a solution when there are twomutually exclusiveoptions. In the world of fin...
The problem was formulated as a bi-level programming problem (BLPP) and then converted into an equivalent one-level mixed-integer linear program so that it could be solved by any MIP solver. Experimental result was reported for instances with different sizes....
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a zero-one polynomial program... HD Sherali,WP Adams - ...
A zero-one mixed integer program in which the integer variables always sum to a constant k in any feasible solution has its solution set contained in the h... RD Young - 《Operations Research》 被引量: 46发表: 1971年 Hypercylindrically Deduced Cuts in Zero-One Integer Programs A zero-one...