The noising method: a new method for combinatorial optimization

Irène Charon; Olivier Hudry

doi:10.1016/0167-6377(93)90023-A

The noising method: a new method for combinatorial optimization

Irène Charon
, Olivier Hudry

Telecom Paris

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	133-137
Number of pages	5
Journal	Operations Research Letters
Volume	14
Issue number	3
DOIs	https://doi.org/10.1016/0167-6377(93)90023-A
Publication status	Published - 1 Jan 1993

Keywords

NP-hard problems
clique partitioning of a graph
combinatorial optimization
heuristics

Access to Document

10.1016/0167-6377(93)90023-A

Cite this

@article{ad30eea8bb6b46b2a81b3a588e928583,

title = "The noising method: a new method for combinatorial optimization",

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.",

keywords = "NP-hard problems, clique partitioning of a graph, combinatorial optimization, heuristics",

author = "Ir{\`e}ne Charon and Olivier Hudry",

year = "1993",

month = jan,

day = "1",

doi = "10.1016/0167-6377(93)90023-A",

language = "English",

volume = "14",

pages = "133--137",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "3",

}

TY - JOUR

T1 - The noising method

T2 - a new method for combinatorial optimization

AU - Charon, Irène

AU - Hudry, Olivier

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

KW - NP-hard problems

KW - clique partitioning of a graph

KW - combinatorial optimization

KW - heuristics

UR - https://www.scopus.com/pages/publications/38248999664

U2 - 10.1016/0167-6377(93)90023-A

DO - 10.1016/0167-6377(93)90023-A

M3 - Article

AN - SCOPUS:38248999664

SN - 0167-6377

VL - 14

SP - 133

EP - 137

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

The noising method: a new method for combinatorial optimization

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this