Easily searched encodings for number partitioning
type: Item
instance of: scholarly article
title: Easily searched encodings for number partitioning
zbMATH Open document ID: 0853.90096
DOI: 10.1007/BF02192530
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 1996-08-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 906463
zbMATH Keywords: number partitioning
zbMATH Keywords: stochastic search algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: problem representation
zbMATH Keywords: choice of encoding
zbMATH Keywords: parameterized arbitration
zbMATH Keywords: parameterized constraint
zbMATH Keywords: parameterized greediness
MaRDI profile type: Publication
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Q4079017
cites work: Q4198056
cites work: Probabilistic analysis of optimum partitioning
cites work: Q4003436
description: scientific article; zbMATH DE number 906463