Easily searched encodings for number partitioning

DOI10.1007/BF02192530zbMath0853.90096MaRDI QIDQ1918002

Yanyan Li

Publication date: 22 August 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

simulated annealingnumber partitioningstochastic search algorithmsproblem representationchoice of encodingparameterized arbitrationparameterized constraintparameterized greediness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (14)

Universal alignment probabilities and subset selection for ordinal optimization ⋮ Two metaheuristic approaches for solving multidimensional two-way number partitioning problem ⋮ GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem ⋮ Performance ratios of the Karmarkar-Karp differencing method ⋮ Easily searched encodings for number partitioning ⋮ Optimisation via encodings: a renormalisation group perspective ⋮ An algebraic expression of the number partitioning problem ⋮ Cover-encodings of fitness landscapes ⋮ A physicist's approach to number partitioning ⋮ A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem ⋮ Searching the landscape of flux vacua with genetic algorithms ⋮ A complete anytime algorithm for number partitioning ⋮ Unnamed Item ⋮ Heuristics and exact methods for number partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Easily searched encodings for number partitioning
• Probabilistic analysis of optimum partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This page was built for publication: Easily searched encodings for number partitioning