Clustered maximum weight clique problem: algorithms and empirical analysis
From MaRDI portal
Publication:1652358
DOI10.1016/j.cor.2017.04.002zbMath1458.90651OpenAlexW2604230932MaRDI QIDQ1652358
Krishna Teja Malladi, Abraham P. Punnen, Snežana Mitrović-Minić
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.002
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Boosting ant colony optimization via solution prediction and machine learning ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ Collaborative mission optimization for ship rapid search by multiple heterogeneous remote sensing satellites
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- Breakout local search for maximum clique problems
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Kernel search: a new heuristic framework for portfolio selection
- A survey of very large-scale neighborhood search techniques
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Approximating the maximum vertex/edge weighted clique using local search
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Phased local search for the maximum clique problem
- A review on algorithms for maximum clique problems
- An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
- Very large-scale variable neighborhood search for the generalized assignment problem
- Maximizing the value of an Earth observation satellite orbit
- Reactive local search for the maximum clique problem
