相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
Yuejian Peng et al.
DISCRETE APPLIED MATHEMATICS (2016)
Infra-chromatic bound for exact maximum clique search
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
A review on algorithms for maximum clique problems
Qinghua Wu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Luis Gouveia et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2015)
A tabu search based memetic algorithm for the maximum diversity problem
Yang Wang et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2014)
Improvements to MCS algorithm for the maximum clique problem
Mikhail Batsyn et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2014)
Heuristics and metaheuristics for the maximum diversity problem
Rafael Marti et al.
JOURNAL OF HEURISTICS (2013)
Comparing local search metaheuristics for the maximum diversity problem
R. Aringhieri et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2011)
A generalization of the Motzkin-Straus theorem to hypergraphs
Samuel Rota Bulo et al.
OPTIMIZATION LETTERS (2009)
Hybrid heuristics for the maximum diversity problem
Micael Gallego et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2009)
Approximating the maximum vertex/edge weighted clique using local search
Wayne Pullan
JOURNAL OF HEURISTICS (2008)
A scalable algorithm for the market basket analysis
Luis Cavique
JOURNAL OF RETAILING AND CONSUMER SERVICES (2007)
New heuristics for the maximum diversity problem
Geiza C. Silva et al.
JOURNAL OF HEURISTICS (2007)
Solving the maximum edge weight clique problem via unconstrained quadratic programming
Bahram Alidaee et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Etsuji Tomita et al.
JOURNAL OF GLOBAL OPTIMIZATION (2007)
A new trust region technique for the maximum weight clique problem
Stanislav Busygin
DISCRETE APPLIED MATHEMATICS (2006)
On a polynomial fractional formulation for independence number of a graph
Balabhaskar Balasundaram et al.
JOURNAL OF GLOBAL OPTIMIZATION (2006)
New facets and a branch-and-cut algorithm for the weighted clique problem
MA Sorensen
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
S Busygin et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2002)
A fast algorithm for the maximum clique problem
PRJ Östergård
DISCRETE APPLIED MATHEMATICS (2002)
Finding independent sets in a graph using continuous multivariable polynomial formulations
J Abello et al.
JOURNAL OF GLOBAL OPTIMIZATION (2001)
A Lagrangian relaxation approach to the edge-weighted clique problem
M Hunting et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
EM Macambira et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
分享论文
