A HEURISTIC PARTITIONING ALGORITHM FOR A PACKAGING PROBLEM

被引：2
|
作者：
KORCHEMKIN, MB
机构：
来源：
COMPUTING | 1983年 / 31卷 / 03期
关键词：
D O I：
10.1007/BF02263431
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：203 / 209
页数：7
相关论文
共 50 条
  • [31] Finding optimal solutions to the graph partitioning problem with heuristic search
    Ariel Felner
    Annals of Mathematics and Artificial Intelligence, 2005, 45 : 293 - 322
  • [32] A heuristic method for solving the problem of partitioning graphs with supply and demand
    Raka Jovanovic
    Abdelkader Bousselham
    Stefan Voß
    Annals of Operations Research, 2015, 235 : 371 - 393
  • [33] Phenotypic genetic algorithm for partitioning problem
    Tagawa, K
    Fukui, T
    Haneda, H
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 553 - 556
  • [34] Genetic algorithm for the set partitioning problem
    Levine, David M.
    Australian Electronics Engineering, 1994, 27 (02):
  • [35] ALGORITHM FOR COMPLETE SET PARTITIONING PROBLEM
    SALKIN, HM
    LIN, CH
    OPERATIONS RESEARCH, 1975, 23 : B389 - B389
  • [36] A partitioning algorithm for the network loading problem
    Babonneau, F.
    Vial, J. -P.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (01) : 173 - 179
  • [37] GRAPH ISOMORPHISM - HEURISTIC EDGE-PARTITIONING-ORIENTED ALGORITHM
    LEVI, G
    COMPUTING, 1974, 12 (04) : 291 - 313
  • [38] Population structure of heuristic search algorithm based on adaptive partitioning
    Han, Chang-Wook
    Park, Jung-I
    ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 238 - 243
  • [39] An efficient heuristic force directed placement algorithm based on partitioning
    Cheng, F
    Mao, J
    INTERNATIONAL JOURNAL OF ELECTRONICS, 2005, 92 (07) : 427 - 436
  • [40] A Heuristic Algorithm for Solving the Problem of Load Balancing
    Wei, Jiayin
    Xu, Daoyun
    Qin, Yongbin
    Zhou, Jincheng
    2015 SEVENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2015, : 89 - 96
12345