A CLASS OF EUCLIDEAN ROUTING-PROBLEMS WITH GENERAL-ROUTE COST-FUNCTIONS

被引：16

作者：

ANILY, S

FEDERGRUEN, A

机构：

[1] TEL AVIV UNIV,FAC MANAGEMENT,IL-69978 TEL AVIV,ISRAEL

[2] COLUMBIA UNIV,GRAD SCH BUSINESS,NEW YORK,NY 10027

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1990年 / 15卷 / 02期

关键词：

D O I：

10.1287/moor.15.2.268

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：268 / 285

页数：18

共 14 条

[1]

ANILY S, 1986, THESIS COLUMBIA U NE

[2]

ANILY S, 1988, IN PRESS MANAGEMENT

[3]

ANILY S, 1986, IN PRESS OPER RES

[4] A PARTITIONING PROBLEM WITH ADDITIVE OBJECTIVE WITH AN APPLICATION TO OPTIMAL INVENTORY GROUPINGS FOR JOINT REPLENISHMENT [J].

CHAKRAVARTY, AK ;

ORLIN, JB ;

ROTHBLUM, UG .

OPERATIONS RESEARCH, 1982, 30 (05) :1018-1022

[5]

DAVID HA, 1970, ORDER STATISTICS

[6]

FEDERGRUEN A, 1985, COMBINED ROUTING INV

[7] IMPLEMENTING VEHICLE ROUTING ALGORITHMS [J].

GOLDEN, BL ;

MAGNANTI, TL ;

NGUYEN, HQ .

NETWORKS, 1977, 7 (02) :113-148

[8]

GOLDEN BL, 1988, IN PRESS NETWORK OPT

[9] BOUNDS AND HEURISTICS FOR CAPACITATED ROUTING-PROBLEMS [J].

HAIMOVICH, M ;

KAN, AHGR .

MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (04) :527-542

[10]

Karp R. M., 1977, Mathematics of Operations Research, V2, P209, DOI 10.1287/moor.2.3.209

← 1 2 →