Resolution Search and Dynamic Branch-and-Bound

被引：0
|
作者：
Saïd Hanafi
Fred Glover
机构：
[1] Université de Valenciennes et du Hainaut-Cambrésis,Unité de Recherche Opérationnelle et d'Aide à la Décision
[2] Le Mont Houy,Hearin Center for Enterprise Science, School of Business Administration
[3] University of Mississippi,undefined
来源：
Journal of Combinatorial Optimization | 2002年 / 6卷
关键词：
branch-and-bound; dynamic branch-and-bound; resolution search; mixed integer programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (Discrete Applied Mathematics, vol. 73, pp. 81–99, 1997) as an alternative to implicit enumeration, with a demonstration that the method can yield more effective branching strategies. We show that an earlier method called Dynamic Branch-and-Bound (B&B) yields the same branching strategies as Resolution Search, and other strategic alternatives in addition. Moreover, Dynamic B&B is not restricted to pure 0-1 problems, but applies to general mixed integer programs containing both general integer and continuous variables.
引用
收藏
页码：401 / 423
页数：22
相关论文
共 50 条
  • [31] Branch-and-bound algorithms on a hypercube
    Pargas, R.P.
    Wooster, D.E.
    Conference on Hypercube Concurrent Computers and Applications, 1988,
  • [32] Fast and accurate computation of the myriad filter via Branch-and-Bound search
    Nunez, Rafael C.
    Gonzalez, Juan G.
    Arce, Gonzalo R.
    Nolan, John P.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (07) : 3340 - 3346
  • [33] HYBRIDISING LOCAL SEARCH WITH BRANCH-AND-BOUND FOR CONSTRAINED PORTFOLIO SELECTION PROBLEMS
    He, Fang
    Qu, Rong
    PROCEEDINGS - 30TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2016, 2016, : 446 - 452
  • [34] A Branch-and-Bound Algorithm with Reduced Search Space for Sparse Filter Design
    Chen, Wangqian
    Huang, Mo
    Lou, Xin
    2018 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS 2018), 2018, : 329 - 332
  • [35] AND/OR Branch-and-Bound for Graphical Models
    Marinescu, Radu
    Dechter, Rina
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 224 - 229
  • [36] BRANCH-AND-BOUND PROGRAM GENERATOR
    NOLTEMEIER, H
    COMPUTING, 1971, 8 (1-2) : 99 - +
  • [37] PROBLEMS UNSOLVABLE BY BRANCH-AND-BOUND
    JEROSLOW, RG
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (04): : A440 - A441
  • [38] Compressing Branch-and-Bound Trees
    Munoz, Gonzalo
    Paat, Joseph
    Xavier, Alinson S.
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2023, 2023, 13904 : 348 - 362
  • [39] A NOTE ON BRANCH-AND-BOUND PRINCIPLE
    BALAS, E
    OPERATIONS RESEARCH, 1968, 16 (02) : 442 - &
  • [40] BRANCH-AND-BOUND METHODS - A SURVEY
    LAWLER, EL
    WOOD, DE
    OPERATIONS RESEARCH, 1966, 14 (04) : 699 - +
12345