AN ADDITIVE BOUNDING PROCEDURE FOR COMBINATORIAL OPTIMIZATION PROBLEMS

被引：65
作者：
FISCHETTI, M
TOTH, P
机构：
来源：
OPERATIONS RESEARCH | 1989年 / 37卷 / 02期
关键词：
D O I：
10.1287/opre.37.2.319
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：319 / 328
页数：10
相关论文
共 22 条
  • [1] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM
    BALAS, E
    CHRISTOFIDES, N
    [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (01) : 19 - 46
  • [2] Bilde O., 1977, ANN DISCRETE MATH, V1, P79
  • [3] Burkard RE., 1979, ANN DISCRETE MATH, V4, P193, DOI [10.1016/S0167-5060(08)70827-6, DOI 10.1016/S0167-5060(08)70827-6]
  • [4] NOTE ON FINDING OPTIMUM BRANCHINGS
    CAMERINI, PM
    FRATTA, L
    MAFFIOLI, F
    [J]. NETWORKS, 1979, 9 (04) : 309 - 312
  • [5] CARPANETO G, 1987, IN PRESS MATH PROG B
  • [6] CARPANETO G, 1987, IN PRESS NETWORKS
  • [7] OPTIMUM BRANCHINGS
    EDMONDS, J
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +
  • [8] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION
    ERLENKOTTER, D
    [J]. OPERATIONS RESEARCH, 1978, 26 (06) : 992 - 1009
  • [9] FISCHETTI M, 1987, ADDITIVE BOUNDING PR
  • [10] FISCHETTI M, 1987, EFFICIENT ALGORITHM
123