Randomized methods for the number partitioning problem

DOI10.1016/0305-0548(95)E0020-LzbMath0868.90093OpenAlexW2157300811MaRDI QIDQ2563882

Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt

Publication date: 6 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)e0020-l

zbMATH Keywords

randomized heuristicsdifferencing methodnumber partitioning problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

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 ⋮ A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem

Cites Work

• Unnamed Item
• Unnamed Item
• A GRASP for a difficult single machine scheduling problem
• Probabilistic analysis of optimum partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

This page was built for publication: Randomized methods for the number partitioning problem