MIXED DECOMPOSITION IN BLOCK INTEGER LINEAR-PROGRAMMING PROBLEMS

被引：0
|
作者：
AVERBAKH, IL
机构：
来源：
AUTOMATION AND REMOTE CONTROL | 1990年 / 51卷 / 07期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A mixed decomposition scheme is proposed for solving block integer linear programming problems that combines elements of Lagrangian relaxation, sequential analysis of alternatives, and dynamic programming. Optimality and epsilon-optimality of the intermediate solutions, finiteness of the method, and monotonicity by the functional value are analyzed. Some issues of a flexible strategy are discussed in terms of the main computational characteristics, such as time and memory requirements and accuracy. Results of numerical experiments are presented.
引用
收藏
页码：947 / 952
页数：6
相关论文
共 50 条
12345