BRANCH-AND-BOUND ALGORITHMS FOR A REGIONAL WATER AUTHORITY DISTRIBUTION PROBLEM

被引：0

作者：

BAKER, BM ^{[1
]}

BAIA, AP ^{[1
]}

机构：

[1] INST POLITECN GUARDA,GUARDA,PORTUGAL

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1995年 / 46卷 / 06期

关键词：

DISTRIBUTION; INTEGER PROGRAMMING; LAGRANGIAN RELAXATION;

D O I：

暂无

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A problem put forward recently by a Regional Water Authority differs from the well-known Capacitated Warehouse Location Problem only in that there are both weeks of normal demand levels and weeks of peak demand levels. We describe how Lagrangian relaxation based branch-and-bound algorithms have been adapted for the new problem. Computational results are given, enabling a comparison of the different approaches tried.

引用

页码：698 / 707

页数：10

共 12 条

[1] EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].