Citations (68)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
BAHRAM ALIDAEE, GARYA. KOCHENBERGER & AHMAD AHMADIAN. (1994) 0-1 Quadratic programming approach for optimum solutions of two scheduling problems. International Journal of Systems Science 25:2, pages 401-408.
Read now
Read now
Panos M. Pardalos & Nisha Desai. (1991) An algorithm for finding a maximum weighted independent set in an arbitrary graph. International Journal of Computer Mathematics 38:3-4, pages 163-175.
Read now
Read now
Articles from other publishers (66)
Qingsong Tang, Xiangde Zhang, Cheng Zhao & Peng Zhao. (2022) On the maxima of motzkin-straus programs and cliques of graphs. Journal of Global Optimization 84:4, pages 989-1003.
Crossref
Crossref
Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko & Vladimir Boginski. (2020) Continuous cubic formulations for cluster detection problems in networks. Mathematical Programming 196:1-2, pages 279-307.
Crossref
Crossref
Sergiy Butenko, Mykyta Makovenko & Miltiades Pardalos. (2022) A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. SIAM Journal on Optimization 32:3, pages 2102-2128.
Crossref
Crossref
Jinyu Dai, Zhengtian Wu, Hamid Reza Karimi, Baoping Jiang & Guangquan Lu. (2022) An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network. Journal of the Franklin Institute 359:12, pages 6080-6098.
Crossref
Crossref
Tong Chen, Jean-Bernard Lasserre, Victor Magron & Edouard Pauwels. (2021) A sublevel moment-SOS hierarchy for polynomial optimization. Computational Optimization and Applications 81:1, pages 31-66.
Crossref
Crossref
James T. Hungerford & Francesco Rinaldi. (2019) A General Regularized Continuous Formulation for the Maximum Clique Problem. Mathematics of Operations Research 44:4, pages 1161-1173.
Crossref
Crossref
Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes & Sergiy Butenko. (2018) A nonconvex quadratic optimization approach to the maximum edge weight clique problem. Journal of Global Optimization 72:2, pages 219-240.
Crossref
Crossref
Yan-ming Chang & Yue-jian Peng. (2018) Maximum Cliques of Hypergraphs and Polynomial Optimization. Acta Mathematicae Applicatae Sinica, English Series 34:4, pages 842-855.
Crossref
Crossref
Qingsong Tang, Xiangde Zhang, Guoren Wang & Cheng Zhao. (2018) A continuous characterization of the maximum vertex-weighted clique in hypergraphs. Journal of Combinatorial Optimization 35:4, pages 1250-1260.
Crossref
Crossref
Oleksandra Yezerska & Sergiy Butenko. 2018. Handbook of Heuristics. Handbook of Heuristics
1
31
.
Samuel Rota Bulò & Marcello Pelillo. (2017) Dominant-set clustering: A review. European Journal of Operational Research 262:1, pages 1-13.
Crossref
Crossref
Qingsong Tang, Yuejian Peng, Xiangde Zhang & Cheng Zhao. (2016) On Motzkin–Straus type results for non-uniform hypergraphs. Journal of Combinatorial Optimization 34:2, pages 504-521.
Crossref
Crossref
Ali Jafarnia Jahromi, Ali Broumandan & Geard Lachapelle. (2016) Gnss signal authenticity verification using carrier phase measurements with multiple receivers. Gnss signal authenticity verification using carrier phase measurements with multiple receivers.
Yanming Chang, Yuejian Peng & Yuping Yao. (2014) Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. Journal of Combinatorial Optimization 31:2, pages 881-892.
Crossref
Crossref
Ran Gu, Xueliang Li, Yuejian Peng & Yongtang Shi. (2014) Some Motzkin–Straus type results for non-uniform hypergraphs. Journal of Combinatorial Optimization 31:1, pages 223-238.
Crossref
Crossref
Yuejian Peng, Qingsong Tang & Cheng Zhao. (2013) On Lagrangians of r-uniform hypergraphs. Journal of Combinatorial Optimization 30:3, pages 812-825.
Crossref
Crossref
Qingsong Tang, Yuejian Peng, Xiangde Zhang & Cheng Zhao. (2013) On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs. Journal of Optimization Theory and Applications 163:1, pages 31-56.
Crossref
Crossref
Gregory Gutin. 2013. Handbook of Graph Theory, Second Edition. Handbook of Graph Theory, Second Edition
475
489
.
Yuejian Peng & Cheng Zhao. (2012) A Motzkin–Straus Type Result for 3-Uniform Hypergraphs. Graphs and Combinatorics 29:3, pages 681-694.
Crossref
Crossref
Gaolin Zheng, Assefa Tesfay, Xinyu Huang & Alade Tokuta. (2013) A Clique-Based Approach to the Identification of Common Gene Association Sub-Networks. Applied Mathematics 04:06, pages 893-898.
Crossref
Crossref
Marcello Pelillo, Samuel Rota Bulò, Andrea Torsello, Andrea Albarelli & Emanuele Rodolà. 2013. Similarity-Based Pattern Analysis and Recognition. Similarity-Based Pattern Analysis and Recognition
179
216
.
Xuncai Zhang, Ruili Fan, Yanfeng Wang & Guangzhao Cui. (2012) 3D DNA self-assembly for the maximum clique problem. 3D DNA self-assembly for the maximum clique problem.
Steffen Rebennack, Gerhard Reinelt & Panos M. Pardalos. (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. International Transactions in Operational Research 19:1-2, pages 161-199.
Crossref
Crossref
Geraldo Regis Mauri & Luiz Antonio Nogueira Lorena. (2011) Lagrangean decompositions for the unconstrained binary quadratic programming problem. International Transactions in Operational Research 18:2, pages 257-270.
Crossref
Crossref
Sergio Tortora, Andrea Sindico & Gaetano Severino. (2010) A data fusion architecture for an Electronic Warfare multi-sensor suite. A data fusion architecture for an Electronic Warfare multi-sensor suite.
Geraldo Regis Mauri & Luiz Antonio Nogueira Lorena. (2009) Geração de colunas com divisão em clusters para o problema de programação quadrática binária irrestrita. Gestão & Produção 16:4, pages 515-525.
Crossref
Crossref
Geraldo Regis Mauri & Luiz Antonio Nogueira Lorena. (2009) Decomposições Lagrangeanas para o problema de programação quadrática binária irrestrita. Pesquisa Operacional 29:1, pages 111-127.
Crossref
Crossref
Samuel Rota Bulò & Marcello Pelillo. (2008) A generalization of the Motzkin–Straus theorem to hypergraphs. Optimization Letters 3:2, pages 287-295.
Crossref
Crossref
Samuel Rota Bulò & Marcello Pelillo. 2008. Learning and Intelligent Optimization. Learning and Intelligent Optimization
220
233
.
Steffen Rebennack. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization
3676
3688
.
Marcello Pelillo. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization
3279
3291
.
Marcello Pelillo. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization
1508
1520
.
Sk. Md. Abu Nayeem & Madhumangal Pal. (2007) Genetic algorithmic approach to find the maximum weight independent set of a graph. Journal of Applied Mathematics and Computing 25:1-2, pages 217-229.
Crossref
Crossref
Marco Budinich & Paolo Budinich. (2006) A spinorial formulation of the maximum clique problem of a graph. Journal of Mathematical Physics 47:4.
Crossref
Crossref
Panos M. Pardalos & Altannar Chinchuluun. (2004) Some recent developments in deterministic global optimization. Operational Research 4:1, pages 3-28.
Crossref
Crossref
Rong Long WangZheng TangQi Ping Cao. (2003) An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning. Neural Computation 15:7, pages 1605-1619.
Crossref
Crossref
Marco Budinich. (2003) Exact bounds on the order of the maximum clique of a graph. Discrete Applied Mathematics 127:3, pages 535-543.
Crossref
Crossref
G. Galán-Marı́n, E. Mérida-Casermeiro & J. Muñoz-Pérez. (2003) Modelling competitive Hopfield networks for the maximum clique problem. Computers & Operations Research 30:4, pages 603-624.
Crossref
Crossref
Rong Long Wang, Zheng Tang & Qi Ping Cao. (2003) An Efficient Algorithm for Maximum Clique Problem Using Improved Hopfield Neural Network.. IEEJ Transactions on Electronics, Information and Systems 123:2, pages 362-367.
Crossref
Crossref
Immanuel M. Bomze, Marco Budinich, Marcello Pelillo & Claudio Rossi. (2002) Annealed replication: a new heuristic for the maximum clique problem. Discrete Applied Mathematics 121:1-3, pages 27-49.
Crossref
Crossref
G. Lohmann & S. Bohn. (2002) Using replicator dynamics for analyzing fMRI data of the human brain. IEEE Transactions on Medical Imaging 21:5, pages 485-492.
Crossref
Crossref
Steven W. Zucker. 2001. Foundations of Image Understanding. Foundations of Image Understanding
289
321
.
Alessio Massaro & Marcello Pelillo. 2001. Advances in Convex Analysis and Global Optimization. Advances in Convex Analysis and Global Optimization
383
394
.
Marcello Pelillo. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization
2197
2209
.
Marcello Pelillo. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization
951
963
.
C. Rossi. (2000) A replicator equations-based evolutionary algorithm for the maximum clique problem. A replicator equations-based evolutionary algorithm for the maximum clique problem.
V. Stix, M. Pelillo & I.R. Bomze. (2000) Approximating the maximum weight clique using replicator dynamics. IEEE Transactions on Neural Networks 11:6, pages 1228-1241.
Crossref
Crossref
Immanuel M. Bomze, Marco Budinich, Marcello Pelillo & Claudio Rossi. 2000. Approximation and Complexity in Numerical Optimization. Approximation and Complexity in Numerical Optimization
78
95
.
Marcello Pelillo, Kaleem Siddiqi & Steven W. Zucker. 2000. Approximation and Complexity in Numerical Optimization. Approximation and Complexity in Numerical Optimization
422
445
.
Marcello Pelillo. (1999) Replicator Equations, Maximal Cliques, and Graph Isomorphism. Neural Computation 11:8, pages 1933-1955.
Crossref
Crossref
M. Pelillo, K. Siddiqi & S.W. Zucker. (1999) Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 21:11, pages 1105-1120.
Crossref
Crossref
Fred Glover, Gary A. Kochenberger & Bahram Alidaee. (1998) Adaptive Memory Tabu Search for Binary Quadratic Programs. Management Science 44:3, pages 336-345.
Crossref
Crossref
T. Miyamoto & S. Kumagai. (1998) Calculating place capacity for Petri nets using unfoldings. Calculating place capacity for Petri nets using unfoldings.
Immanuel M. Bomze & Franz Rendl. 1998. High Performance Algorithms and Software in Nonlinear Optimization. High Performance Algorithms and Software in Nonlinear Optimization
53
67
.
Panos M. Pardalos, Thelma Mavridou & Jue Xue. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization
1077
1141
.
Immanuel Bomze, Marcello Pelillo & Robert Giacomini. 1997. Developments in Global Optimization. Developments in Global Optimization
95
108
.
Marcello Pelillo & Immanuel M. Bomze. 1996. Parallel Problem Solving from Nature — PPSN IV. Parallel Problem Solving from Nature — PPSN IV
676
685
.
Marcello Pelillo. 1996. Recent Developments in Computer Vision. Recent Developments in Computer Vision
341
352
.
J. Douglas Carroll & James E. Corter. (1995) A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees. Journal of Classification 12:2, pages 283-313.
Crossref
Crossref
Panos M. Pardalos & Jue Xue. (1994) The maximum clique problem. Journal of Global Optimization 4:3, pages 301-328.
Crossref
Crossref
Michel Gendreau, Patrick Soriano & Louis Salvail. (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research 41:4, pages 385-403.
Crossref
Crossref
Fayau Lin. (1993) A parallel computation network for the maximum clique problem. A parallel computation network for the maximum clique problem.
F. Lin. (1993) A parallel computation network for the maximum clique problem. A parallel computation network for the maximum clique problem.
Nubuo Funabiki, Yoshiyasu Takefuji & Kuo-Chun Lee. (1992) A neural network model for finding a near-maximum clique. Journal of Parallel and Distributed Computing 14:3, pages 340-344.
Crossref
Crossref
Yoshiyasu TakefujiYoshiyasu Takefuji. 1992. Neural Network Parallel Computing. Neural Network Parallel Computing
197
215
.
K.C. Lee, N. Funabiki, Y.B. Cho & Y. Takefuji. (1991) A parallel neural network computing for the maximum clique problem. A parallel neural network computing for the maximum clique problem.