HABITAT DISPERSION IN FOREST PLANNING AND THE STABLE SET PROBLEM

被引:36
作者
BARAHONA, F [1 ]
WEINTRAUB, A [1 ]
EPSTEIN, R [1 ]
机构
[1] UNIV CHILE, SANTIAGO, CHILE
关键词
D O I
10.1287/opre.40.1.S14
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We present a model for forest planning with habitat dispersion constraints. The problem is reduced to a linear program that is solved by a column generation approach. Generating one column reduces to a stable set problem in a graph; this is solved with linear programming techniques based on a partial description of the stable set polytope. We report computational experience with medium sized problems.
引用
收藏
页码:S14 / S21
页数:8
相关论文
共 35 条
[1]   EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING [J].
BARAHONA, F ;
JUNGER, M ;
REINELT, G .
MATHEMATICAL PROGRAMMING, 1989, 44 (02) :127-137
[2]   AN APPLICATION OF COMBINATORIAL OPTIMIZATION TO STATISTICAL PHYSICS AND CIRCUIT LAYOUT DESIGN [J].
BARAHONA, F ;
GROTSCHEL, M ;
JUNGER, M ;
REINELT, G .
OPERATIONS RESEARCH, 1988, 36 (03) :493-513
[3]   ON THE EXACT GROUND-STATES OF 3-DIMENSIONAL ISING SPIN-GLASSES [J].
BARAHONA, F ;
MACCIONI, E .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (11) :L611-L615
[4]  
BARAHONA F, 1987, CORR8747 U WAT RES R
[5]  
BARAHONA F, 1989, CORR8911 U WAT RES R
[6]  
BARE B, 1984, MAY TIMS ORSA JOINT, P19
[7]   CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].
CHVATAL, V .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (02) :138-154
[8]  
CONNELLY W, 1988, P SOC AM FORESTERS S, P131
[9]  
COVINGTON WW, 1988, J FOREST, V86, P25
[10]   A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J].
FORD, LR ;
FULKERSON, DR .
MANAGEMENT SCIENCE, 1958, 5 (01) :97-101