Randomized methods for the number partitioning problem
type: Item
instance of: scholarly article
title: Randomized methods for the number partitioning problem
zbMATH Open document ID: 0868.90093
DOI: 10.1016/0305-0548(95)E0020-L
author: Michael F. Argüello
author: Thomas A. Feo
author: Olivier Goldschmidt
published in: Computers \& Operations Research
publication date: 1997-01-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 960886
zbMATH Keywords: differencing method
zbMATH Keywords: number partitioning problem
zbMATH Keywords: randomized heuristics
MaRDI profile type: Publication
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: A GRASP for a difficult single machine scheduling problem
cites work: Q4198056
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Probabilistic analysis of optimum partitioning
cites work: Q4739657
full work available at URL: 0305-0548(95)e0020-l
OpenAlex ID: W2157300811
Recommended article: Heuristics and exact methods for number partitioning
Recommended article: Probabilistic analysis of the number partitioning problem
Recommended article: Q3323996
Recommended article: Approximation algorithms for semi-random partitioning problems
Recommended article: Random partitions and Cohen-Lenstra heuristics
Recommended article: Q3323995
Recommended article: Optimal Multi-Way Number Partitioning
Recommended article: A complete anytime algorithm for number partitioning
Recommended article: Random partitions by semigroup methods
description: scientific article