Experiments in the formulation of integer programming problems
Experiments in the formulation of integer programming problems
复制标题
整数规划问题表述的实验
DOI：
10.1007/bfb0120693
复制
发表时间：
1974
影响因子：
5
通讯作者：
H. P. Williams
中科院分区：
文献类型：
--
作者：
H. P. Williams
五个实际问题，每个制定在两种不同的方式为0-1整数规划模型。所有模型均采用分支定界法求解。完整的细节给出了不同配方的方式和计算容易解决它们。本文的目的是研究不同的公式对这类问题的计算效果。所考虑的问题是市场分配问题，组合问题，两个挖掘问题和逻辑设计问题。
Five practical problems are each formulated in two different ways as 0–1 integer programming models. All the models have been solved by the Branch and Bound method using a commercial package program. Full details are given of the manner of the different formulations and the computational ease of solving them. The purpose of this paper is to investigate the computational effects of different formulations on such problems. The problems considered are a market allocation problem, a combinatorial problem, two mining problems and a problem of logical design.