Evaluating the impact of AND/OR search on 0-1 integer linear programming

被引:0
|
作者
Radu Marinescu
Rina Dechter
机构
[1] University College Cork,Cork Constraint Computation Centre
[2] University of California,Donald Bren School of Information and Computer Science
来源
Constraints | 2010年 / 15卷
关键词
Search; AND/OR search spaces; Constraint optimization; Integer programming;
D O I
暂无
中图分类号
学科分类号
摘要
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-first AND/OR search algorithms to solving 0-1 Integer Linear Programs (0-1 ILP) within this framework. We also include a class of dynamic variable ordering heuristics while exploring an AND/OR search tree for 0-1 ILPs. We demonstrate the effectiveness of these search algorithms on a variety of benchmarks, including real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.
引用
收藏
页码:29 / 63
页数:34
相关论文
共 50 条
  • [1] Evaluating the impact of AND/OR search on 0-1 integer linear programming
    Marinescu, Radu
    Dechter, Rina
    [J]. CONSTRAINTS, 2010, 15 (01) : 29 - 63
  • [2] Constraint violation reduction search for 0-1 mixed integer linear programming problems
    Bansal, Ankit
    Uzsoy, Reha
    [J]. ENGINEERING OPTIMIZATION, 2021, 53 (04) : 609 - 626
  • [3] Proximity search for 0-1 mixed-integer convex programming
    Fischetti, Matteo
    Monaci, Michele
    [J]. JOURNAL OF HEURISTICS, 2014, 20 (06) : 709 - 731
  • [4] Proximity search for 0-1 mixed-integer convex programming
    Matteo Fischetti
    Michele Monaci
    [J]. Journal of Heuristics, 2014, 20 : 709 - 731
  • [5] A HEURISTIC 0-1 INTEGER PROGRAMMING METHOD
    BAESSLER, F
    [J]. OR SPEKTRUM, 1992, 14 (01): : 11 - 18
  • [6] A 0-1 integer linear programming based approach for global locality optimizations
    Xia, Jun
    Luo, Li
    Yang, Xuejun
    [J]. ADVANCES IN COMPUTER SYSTEMS ARCHITECTURE, PROCEEDINGS, 2006, 4186 : 281 - 294
  • [7] Nonlinear separation of data via mixed 0-1 Integer and Linear Programming
    Kim, Kwangsoo
    Ryoo, Hong Seo
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 193 (01) : 183 - 196
  • [8] An improved integer linear programming formulation for the closest 0-1 string problem
    Arbib, Claudio
    Servilio, Mara
    Ventura, Paolo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 80 : 94 - 100
  • [9] Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
    Soylu, Banu
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 245 (03) : 690 - 703
  • [10] Solving large-scale 0-1 integer programming models with tabu search
    Hanafi, S
    Amrani, F
    Freville, A
    [J]. FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 32 - 39