The noising method: a new method for combinatorial optimization

Authors:
Irène Charon;Olivier Hudry
Affiliations:
Ecole Nationale Supérieure des Télécommunications, Paris, France;Ecole Nationale Supérieure des Télécommunications, Paris, France
Venue:
Operations Research Letters
Year:
1993

Citing 3
Cited 9

NP-hard problems in hierarchical-tree clustering

Acta Informatica
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Solving the one-dimensional bin packing problem with a weight annealing heuristic

Computers and Operations Research
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Computers and Operations Research
A tabu search approach for the minimum sum-of-squares clustering problem

Information Sciences: an International Journal
Noising methods for a clique partitioning problem

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A modified noising algorithm for the graph partitioning problem

Integration, the VLSI Journal
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Computers and Operations Research
A survey on optimization metaheuristics

Information Sciences: an International Journal
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the principles and the first results of a new combinatorial optimization method that we call the noising method. It is applied to the NP-hard problem of the clique partitioning of a graph. The results obtained from this problem which are definitely better than those provided by standard iterative-improvement methods and compare favorably with those of simulated annealing, show the relevance of the noising method.