Clustered maximum weight clique problem: algorithms and empirical analysis
type: Item
instance of: scholarly article
title: Clustered maximum weight clique problem: algorithms and empirical analysis
zbMATH Open document ID: 1458.90651
author: Krishna Teja Malladi
author: Abraham P. Punnen
author: Snežana Mitrović-Minić
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6901453
zbMATH Keywords: clique
zbMATH Keywords: neighborhood search heuristic
zbMATH Keywords: matheuristic
zbMATH Keywords: satellite image acquisition
describes a project that uses: BHOSLIB
describes a project that uses: Tabu search
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.cor.2017.04.002
OpenAlex ID: W2604230932
cites work: A survey of very large-scale neighborhood search techniques
cites work: Kernel search: a new heuristic framework for portfolio selection
cites work: Reactive local search for the maximum clique problem
cites work: Breakout local search for maximum clique problems
cites work: A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
cites work: Maximizing the value of an Earth observation satellite orbit
cites work: An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Q4354785
cites work: Very large-scale variable neighborhood search for the generalized assignment problem
cites work: Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
cites work: Phased local search for the maximum clique problem
cites work: Approximating the maximum vertex/edge weighted clique using local search
cites work: Q3623999
cites work: A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
cites work: Solving the maximum vertex weight clique problem via binary quadratic programming
cites work: An adaptive multistart tabu search approach to solve the maximum clique problem
cites work: A review on algorithms for maximum clique problems
DOI: 10.1016/J.COR.2017.04.002
description: scientific article; zbMATH DE number 6901453