A multiplier adjustment technique for the capacitated concentrator location problem

被引：2

作者：

Celani, M

Cerulli, R

Gaudioso, M

Sergeyev, YD

机构：

[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84084 Salerno, Italy

[2] Univ Calabria, Dipartimento Elettron Informat & Sistemist, I-87030 Cosenza, Italy

[3] CNR, Ist Sistemist & Informat, I-87030 Cosenza, Italy

[4] Univ Nizhni Novgorod, Fac Computat Math & Cybernet, Nizhnii Novgorod, Russia

来源：

OPTIMIZATION METHODS & SOFTWARE | 1998年 / 10卷 / 01期

关键词：

D O I：

10.1080/10556789808805703

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We describe a new dual descent method for a pure 0-1 location problem known as the capacitated concentrator location problem. The multiplier adjustment technique presented is aimed to find an upper bound in a Lagrangean relaxation context permitting both to decrease and to increase multipliers in the course of the search in contrast with methods where that ones are monotonically updated.

引用

页码：87 / 102

页数：16

共 11 条

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