A polynomial case of unconstrained zero-one quadratic optimization

被引：45

作者：

Allemand, K ^{[1
]}

Fukuda, K ^{[1
]}

Liebling, TM ^{[1
]}

Steiner, E ^{[1
]}

机构：

[1] EPFL, Dept Math, CH-1015 Lausanne, Switzerland

来源：

MATHEMATICAL PROGRAMMING | 2001年 / 91卷 / 01期

关键词：

Objective Function; Polynomial Time; Symmetric Matrix; Maximization Problem; Spectral Decomposition;

D O I：

10.1007/s101070100233

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known Spectral decomposition.

引用

页码：49 / 52

页数：4

共 50 条

[1] A polynomial case of unconstrained zero-one quadratic optimization
Kim Allemand
Komei Fukuda
Thomas M. Liebling
Erich Steiner
[J]. Mathematical Programming, 2001, 91 : 49 - 52
[2] EFFICIENT REDUCTION OF POLYNOMIAL ZERO-ONE OPTIMIZATION TO THE QUADRATIC CASE
Buchheim, Christoph
Rinaldi, Giovanni
[J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 18 (04) : 1398 - 1413
[3] Algorithm for quadratic zero-one programs
Kalantari, B.
Bagchi, A.
[J]. Naval Research Logistics, 1990, 37 (04)
[4] AN ALGORITHM FOR QUADRATIC ZERO-ONE PROGRAMS
KALANTARI, B
BAGCHI, A
[J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (04) : 527 - 538
[5] THE INDEFINITE ZERO-ONE QUADRATIC PROBLEM
CARTER, MW
[J]. DISCRETE APPLIED MATHEMATICS, 1984, 7 (01) : 23 - 44
[6] A quadratic simplex algorithm for primal optimization over zero-one polytopes
Mallach, Sven
[J]. DISCRETE APPLIED MATHEMATICS, 2024, 347 : 285 - 296
[7] The Basic Algorithm for Zero-One Unconstrained Quadratic Programming Problem with k-diagonal Matrix
Gu, Shenshen
Chen, Xinyi
[J]. 2020 12TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2020, : 609 - 613
[8] A HEURISTIC-BASED BRANCH-AND-BOUND ALGORITHM FOR UNCONSTRAINED QUADRATIC ZERO-ONE PROGRAMMING
PALUBECKIS, G
[J]. COMPUTING, 1995, 54 (04) : 283 - 301
[9] Cost-of-Quality Optimization via Zero-One Polynomial Programming
Lim, Churlzu
Sherali, Hanif D.
Glickman, Theodore S.
[J]. IIE TRANSACTIONS, 2015, 47 (03) : 258 - 273
[10] FURTHER REDUCTION OF ZERO-ONE POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS
GLOVER, F
WOOLSEY, E
[J]. OPERATIONS RESEARCH, 1973, 21 (01) : 156 - 161

← 1 2 3 4 5 →