An exact algorithm for the maximum quasi-clique problem

Título:

An exact algorithm for the maximum quasi-clique problem

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2019

DOI:

10.1111/itor.12637

Revista:

International Transactions in Operational Research

ISSN:

09696016

Tags:

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Probability Distribution of Solution Time in GRASP: An Experimental Investigation

The Traveling Tournament Problem with Predefined Venues

On the use of run time distributions to to evaluate and compare stochastic local search algorithms

Polarization reduction by minimum-cardinality edge additions: Complexity and integer programming

Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem

Performance Evaluation of Vector Implementations of Combinatorial Algorithms

Variable Neighborhood Search for the Degree-Constrained Minimum Spanning Tree Problem

Path-relinking intensification methods for stochastic local search algorithms

A Linear Time Algorithm for the Computation of Some Distance Functions between Convex Polygons

Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches