Pseudo-Boolean optimization

被引:437
作者
Boros, E [1 ]
Hammer, PL [1 ]
机构
[1] Rutgers State Univ, RUTCOR, Piscataway, NJ 08854 USA
关键词
D O I
10.1016/S0166-218X(01)00336-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions, The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:155 / 225
页数:71
相关论文
共 169 条
[1]   UNCONSTRAINED 0-1 OPTIMIZATION AND LAGRANGEAN RELAXATION [J].
ADAMS, WE ;
BILLIONNET, A ;
SUTTER, A .
DISCRETE APPLIED MATHEMATICS, 1990, 29 (2-3) :131-142
[2]   ON THE EQUIVALENCE BETWEEN ROOF DUALITY AND LAGRANGIAN-DUALITY FOR UNCONSTRAINED 0-1 QUADRATIC-PROGRAMMING PROBLEMS [J].
ADAMS, WP ;
DEARING, PM .
DISCRETE APPLIED MATHEMATICS, 1994, 48 (01) :1-20
[3]   A TIGHT LINEARIZATION AND AN ALGORITHM FOR ZERO-ONE QUADRATIC-PROGRAMMING PROBLEMS [J].
ADAMS, WP ;
SHERALI, HD .
MANAGEMENT SCIENCE, 1986, 32 (10) :1274-1290
[4]  
ALEXE G, 2001, BOOLEAN SIMPLIFICATI
[5]  
ALON N, 1992, PROBABILISTIC METHOD
[6]  
[Anonymous], 1986, C NUM METH COMB OPT
[7]  
[Anonymous], 1966, Management Science, DOI DOI 10.1287/MNSC.12.7.485
[8]  
[Anonymous], SIAM STUDIES APPL MA
[9]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[10]  
[Anonymous], 1982, GAME THEORY