THE MAXIMUM CAPTURE PROBLEM IN A WEIGHTED NETWORK

被引：34

作者：

EISELT, HA ^{[1
]}

LAPORTE, G ^{[1
]}

机构：

[1] UNIV MONTREAL, CTR RECH TRANSPORTS, MONTREAL H3C 3J7, QUEBEC, CANADA

来源：

关键词：

D O I：

10.1111/j.1467-9787.1989.tb01388.x

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

引用

页码：433 / 439

页数：7

共 19 条

AURENHAMMER, F ;

EDELSBRUNNER, H .

[2] WEIGHTING THIESSEN POLYGONS [J].

BOOTS, BN .

[3]

CONVERSE PD, 1948, BUSINESS STUDIES, V6

[4]

EISELT HA, 1988, RAIRO-RECH OPER, V22, P33

[5]

EISELT HA, 1986, P ASAC, V7, P98

[6]

EISELT HA, 1988, ASIA PACIFIC J OPERA

[7] A SWEEPLINE ALGORITHM FOR VORONOI DIAGRAMS [J].

FORTUNE, S .

[8] ON LOCATING NEW FACILITIES IN A COMPETITIVE ENVIRONMENT [J].

HAKIMI, SL .

[9] DEFINING AND ESTIMATING A TRADING AREA [J].

HUFF, DL .

HUFF, DL .