A nonconvex quadratic optimization approach to the maximum edge weight clique problem
type: Item
instance of: scholarly article
title: A nonconvex quadratic optimization approach to the maximum edge weight clique problem
zbMATH Open document ID: 1417.90145
author: Seyedmohammadhossein Hosseinian
author: Dalila B. M. M. Fontes
author: Sergiy Butenko
published in: Journal of Global Optimization
publication date: 2018-12-21T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6996789
zbMATH Keywords: maximum edge weight clique problem
zbMATH Keywords: quadratic optimization
zbMATH Keywords: continuous approaches to discrete problems
describes a project that uses: QUALEX
MaRDI profile type: Publication
full work available at URL: s10898-018-0630-5
OpenAlex ID: W2789302726
cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations.
cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming
cites work: On a polynomial fractional formulation for independence number of a graph
cites work: Improvements to MCS algorithm for the maximum clique problem
cites work: Evolution towards the maximum clique
cites work: Q4527182
cites work: A generalization of the Motzkin-Straus theorem to hypergraphs
cites work: A new trust region technique for the maximum weight clique problem
cites work: A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
cites work: An exact algorithm for the maximum clique problem
cites work: Experimental and Efficient Algorithms
cites work: A cutting-plane approach to the edge-weighted maximal clique problem
cites work: On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
cites work: Hybrid heuristics for the maximum diversity problem
cites work: Q5687252
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
cites work: A lower bound on the independence number of a graph
cites work: Some news about the independence number of a graph
cites work: On Dominating Sets and Independent Sets of Graphs
cites work: A Lagrangian relaxation approach to the edge-weighted clique problem
cites work: Reducibility among Combinatorial Problems
cites work: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: A fast algorithm for the maximum clique problem
cites work: Iterated tabu search for the maximum diversity problem
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: A global optimization approach for solving the maximum clique problem
cites work: An extended formulation approach to the edge-weighted maximal clique problem
cites work: An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
cites work: Approximating the maximum vertex/edge weighted clique using local search
cites work: Infra-chromatic bound for exact maximum clique search
cites work: New facets and a branch-and-cut algorithm for the weighted clique problem.
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: A review on algorithms for maximum clique problems
DOI: 10.1007/S10898-018-0630-5
description: scientific article; zbMATH DE number 6996789