A Three-Phased Local Search Approach for the Clique Partitioning Problem

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-015-9964-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

An Iterated Tabu Search Approach for the Clique Partitioning Problem

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2014English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems
2015English

Homecare Staff Scheduling Problem Using a GA Based Approach With Local Search Techniques

2019English

Đề Xuất Thuật Toán Local Search Giải Bài Toán Max Clique

2017English

An Iterated Local Search Algorithm for a Place Scheduling Problem

Mathematical Problems in Engineering
MathematicsEngineering
2013English

PUSH: A Generalized Operator for the Maximum Vertex Weight Clique Problem

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Reactive Stochastic Local Search Algorithms for the Genomic Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A Scatter Search Approach for Multiobjective Selective Disassembly Sequence Problem

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy