A LAGRANGIAN HEURISTIC FOR THE CAPACITATED PLANT LOCATION PROBLEM WITH SIDE CONSTRAINTS

被引：0

作者：

SRIDHARAN, R

机构：

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1991年 / 42卷 / 07期

关键词：

LOCATION; ALLOCATION; HEURISTICS;

D O I：

暂无

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we present a Lagrangian relaxation-based heuristic for solving the capacitated plant-location problem with side constraints. The side constraints are upper-bound constraints on disjoint subsets of the (0-1) variables. Computational results are reported for some problems, having been obtained both on a mainframe computer and on a personal computer.

引用

页码：579 / 585

页数：7

共 9 条

[1]

BEASLEY JE, 1990, LAGRANGEAN HEURISTIC

[2] EXTENSIONS TO A LAGRANGEAN RELAXATION APPROACH FOR THE CAPACITATED WAREHOUSE LOCATION PROBLEM [J].