A PROJECTED NEWTON METHOD FOR 1P NORM LOCATION-PROBLEMS

被引：38

作者：

CALAMAI, PH

CONN, AR

机构：

[1] ARGONNE NATL LAB, DIV MATH & COMP SCI, ARGONNE, IL 60439 USA

[2] UNIV WATERLOO, DEPT COMP SCI, WATERLOO N2L 3G1, ONTARIO, CANADA

来源：

MATHEMATICAL PROGRAMMING | 1987年 / 38卷 / 01期

关键词：

D O I：

10.1007/BF02591853

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：75 / 109

页数：35

共 37 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Busovaca S., 1985, THESIS U WATERLOO WA

[3] SOLVING MULTIFACILITY LOCATION-PROBLEMS INVOLVING EUCLIDEAN DISTANCES [J].

CALAMAI, P ;

CHARALAMBOUS, C .

NAVAL RESEARCH LOGISTICS, 1980, 27 (04) :609-620

[4] A STABLE ALGORITHM FOR SOLVING THE MULTIFACILITY LOCATION PROBLEM INVOLVING EUCLIDEAN DISTANCES [J].

CALAMAI, PH ;

CONN, AR .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1980, 1 (04) :512-526

[5]

CALAMAI PH, 1982, LECT NOTES MATH, V912, P1

[6]

CALAMAI PH, 1983, THESIS U WATERLOO WA

[7]

Chvatal V., 1983, LINEAR PROGRAMMING

[8]

Clarke FH., 1983, OPTIMIZATION NONSMOO, P357

[9] NON-LINEAR PROGRAMMING VIA AN EXACT PENALTY-FUNCTION - ASYMPTOTIC ANALYSIS [J].

COLEMAN, TF ;

CONN, AR .

MATHEMATICAL PROGRAMMING, 1982, 24 (02) :123-136

[10] NON-LINEAR PROGRAMMING VIA AN EXACT PENALTY-FUNCTION - GLOBAL ANALYSIS [J].

COLEMAN, TF ;

CONN, AR .

MATHEMATICAL PROGRAMMING, 1982, 24 (02) :137-161

← 1 2 3 4 →