Variable neighborhood search for the heaviest k-subgraph

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Computers & Operations Research

• Publication date

  2009-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2008.12.020
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hybrid heuristics for the maximum diversity problem

  2009influential reference
• Variable Neighborhood Search

  2009cited by this paper
• Tabu Search versus GRASP for the maximum diversity problem

  2008cited by this paper
• A deterministic approximation algorithm for the Densest k-Subgraph Problem

  2008cited by this paper
• Tabu search and GRASP for the maximum diversity problem

  2007influential reference
• New heuristics for the maximum diversity problem

  2007cited by this paper
• Iterated tabu search for the maximum diversity problem

  2007influential reference
• First improvement may be better than best improvment: an empirical study

  2005cited by this paper
• Different Formulations for Solving the Heaviest K-Subgraph Problem

  2005cited by this paper
• An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

  2002influential reference
• First vs. best improvement: An empirical study

  1999cited by this paper
• Finding Dense Subgraphs with Semidefinite Programming

  1998cited by this paper
• Variable neighborhood search

  1997cited by this paper
• Computational aspects of the maximum diversity problem

  1996cited by this paper
• Obtaining test problems via Internet

  1996cited by this paper
• Good solutions to discrete noxious location problems via metaheuristics

  1993cited by this paper
• The discrete p-dispersion problem

  1990cited by this paper
• Clustering and domination in perfect graphs

  1984cited by this paper

• First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim

  2025cites this paper
• Chemical reaction optimization for solving maximum diversity problem

  2025cites this paper
• General Variable Neighborhood Search for Maximum Diversity Problem with Capacity and Budget Constraints

  2024cites this paper
• GPU tabu search: A study on using GPU to solve massive instances of the maximum diversity problem

  2024cites this paper
• Reliability Groups with Standby Flying Light Specks

  2024cites this paper
• A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems

  2023cites this paper
• Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem

  2023cites this paper
• An Evaluation of Decentralized Group Formation Techniques for Flying Light Specks

  2023cites this paper
• A method for the systematic selection of enzyme panel candidates by solving the maximum diversity problem

  2023cites this paper
• A memetic algorithm for finding multiple subgraphs that optimally cover an input network

  2023influential citation
• Fast Rerandomization via the BRAIN

  2023cites this paper
• Automatic Diverse Subset Selection From Enzyme Families by Solving the Maximum Diversity Problem

  2022cites this paper
• A new heuristic for finding verifiable k-vertex-critical subgraphs

  2022cites this paper
• Identification of road links with the gravest network impacts when blocked concurrently

  2022cites this paper
• An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*

  2022cites this paper
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem

  2021cites this paper
• A review on discrete diversity and dispersion maximization from an OR perspective

  2021influential citation
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem

  2020cites this paper
• Intensification-driven tabu search for the minimum differential dispersion problem

  2019cites this paper
• A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem

  2019cites this paper
• On solving the densest k-subgraph problem on large graphs

  2019influential citation
• Intensi cation-driven tabu search for the minimum di erential dispersion problem

  2019cites this paper
• Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs

  2019cites this paper
• Exact approaches for the orderly colored longest path problem: Performance comparison

  2019cites this paper
• Solution-based tabu search for the maximum min-sum dispersion problem

  2018cites this paper
• Solving Bi-criteria Maximum Diversity Problem with Multi-objective Multi-level Algorithm

  2018cites this paper
• Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

  2018cites this paper
• Diversity and Equity Models

  2018cites this paper
• Solving the maximum min-sum dispersion by alternating formulations of two different problems

  2017cites this paper
• El problema de la dispersión máxima en un entorno multi-objetivo

  2017cites this paper
• A note on heuristic approach based on UBQP formulation of the maximum diversity problem

  2017cites this paper
• Opposition-Based Memetic Search for the Maximum Diversity Problem

  2017influential citation
• Algorithms over dynamic graphs

  2015cites this paper
• A review on algorithms for maximum clique problems

  2015cites this paper
• Construction and improvement algorithms for dispersion problems

  2015influential citation
• Decentralized group formation

  2014cites this paper
• MaxMinMin p-dispersion problem: A variable neighborhood search approach

  2014influential citation
• A tabu search based memetic algorithm for the maximum diversity problem

  2014influential citation
• Recursive Variable Neighborhood Search

  2014cites this paper
• Enhancing variable neighborhood search by adding memory: Application to a real logistic problem

  2014cites this paper
• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences

  2014cites this paper
• Adaptive Heterogeneous Multi-Population Cultural Algorithm

  2014cites this paper
• Decentralized k-Clique Matching

  2014cites this paper
• Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search

  2013cites this paper
• A hybrid metaheuristic method for the Maximum Diversity Problem

  2013influential citation
• Graph Theoretic Clique Relaxations and Applications

  2013cites this paper
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem

  2013influential citation
• Metaheuristics for large binary quadratic optimization and its applications. (Métaheuristiques pour l'optimisation quadratique en 0/1 à grande échelle et ses applications)

  2013cites this paper
• The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe)

  2013influential citation
• Distance-constrained vehicle routing problem: exact and approximate solution (mathematical programming)

  2013cites this paper
• Incorporating a Genetic Algorithm to improve the performance of Variable Neighborhood Search

  2012cites this paper
• Variable Neighborhood Search Heuristics for the MaxMinSum (p-Dispersion-Sum) Problem

  2012cites this paper
• Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling)

  2012cites this paper
• WITHDRAWN: Adaptive GRASP for the Maximum Diversity Problem

  2012cites this paper
• A Greedy Variable Neighborhood Search Heuristic for the MaxSumSum p -Dispersion Problem

  2012influential citation
• Learnable tabu search guided by estimation of distribution for maximum diversity problems

  2012influential citation
• Heuristics and metaheuristics for the maximum diversity problem

  2011influential citation
• Iterated greedy for the maximum diversity problem

  2011cites this paper
• Variable neighborhood search for the travelling deliveryman problem

  2011cites this paper
• Comparing local search metaheuristics for the maximum diversity problem

  2011influential citation
• Genetic algorithm and variable neighbourhood search for BDD variable ordering problem

  2011cites this paper
• Variable neighbourhood search: methods and applications

  2010cites this paper
• Optimal Decentralized Formation of k-Member Partnerships

  2010cites this paper
• Optimal decentralized formation of k-member partnerships (May 9, 2010)

  2010cites this paper
• New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering

  2010cites this paper