FACILITY SITING AND INTEGER-FRIENDLY PROGRAMMING

被引:97
作者
REVELLE, C [1 ]
机构
[1] JOHNS HOPKINS UNIV,PROGRAM SYST ANAL & ECON PUBL DECIS MAKING,BALTIMORE,MD 21218
关键词
FACILITY SITING; LOCATION ANALYSIS; LINEAR PROGRAMMING; INTEGER PROGRAMMING; BRANCH-AND-BOUND;
D O I
10.1016/0377-2217(93)90329-L
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Facility siting on networks has been accomplished with some success via integer linear programming formulations of a particular character. Specifically, 'constraint expansion', often brings about zero-one solutions with little or no branching and bounding. Additionally, when multi-objective zero-one programming problems require solution, the weighting method may often be employed with some success. Examples of constraint-expanded and multi-objective problems from facility siting and from other settings are analyzed for common features.
引用
收藏
页码:147 / 158
页数:12
相关论文
共 16 条
[1]   INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].
BALINSKI, ML .
MANAGEMENT SCIENCE, 1965, 12 (03) :253-313
[2]   A HYBRID FLEET MODEL FOR EMERGENCY MEDICAL-SERVICE SYSTEM-DESIGN [J].
BIANCHI, G ;
CHURCH, RL .
SOCIAL SCIENCE & MEDICINE, 1988, 26 (01) :163-171
[3]  
Church R.L., 1974, PAPERS REGIONAL SCI, V32, P118, DOI DOI 10.1007/BF01942293
[4]  
Cohon J., 1978, MULTIOBJECTIVE PROGR
[5]   A BRANCH-BOUND ALGORITHM FOR PLANT LOCATION [J].
EFROYMSON, MA ;
RAY, TL .
OPERATIONS RESEARCH, 1966, 14 (03) :361-+
[6]   DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].
ERLENKOTTER, D .
OPERATIONS RESEARCH, 1978, 26 (06) :992-1009
[8]  
KOLESAR D, 1967, MANAGE SCI, V13, P723
[9]  
MARIANOV V, 1993, IN PRESS P ISOLDEV A