POLYHEDRAL RESULTS FOR A VEHICLE-ROUTING PROBLEM

被引：16

作者：

CAMPOS, V

CORBERAN, A

MOTA, E

机构：

[1] Departamento de Estadstica e Investigación Operativa, Facultad de Matemáticas, Universidad de Valencia, Valencia

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1991年 / 52卷 / 01期

关键词：

VEHICLE ROUTING PROBLEM; FACETS; INTEGER PROGRAMMING; NETWORKS;

D O I：

10.1016/0377-2217(91)90337-U

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.

引用

页码：75 / 85

页数：11

共 34 条

[1] BACHEM A, 1982, MODERN APPLIED MATH, P51
[2] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[3] CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING
BODIN, L
GOLDEN, B
[J]. NETWORKS, 1981, 11 (02) : 97 - 108
[4] Christofides N., 1979, Combinatorial optimization, P315
[5] Christofides N., 1985, TRAVELING SALESMAN P, P431
[6] CHRISTOFIDES N, 1985, COMBINATORIAL OPTIMI, P148
[7] DESCROCHERS M, 1987, OSR8721 CTR MATH COM
[8] Eilon S., 1971, DISTRIBUTION MANAGEM
[9] Golden B., 1988, STUDIES MANAGEMENT S, V16
[10] PERSPECTIVES ON VEHICLE-ROUTING - EXCITING NEW DEVELOPMENTS
GOLDEN, BL
ASSAD, AA
[J]. OPERATIONS RESEARCH, 1986, 34 (05) : 803 - 810

← 1 2 3 4 →