Randomized methods for the number partitioning problem
From MaRDI portal
Publication:2563882
Recommendations
- Heuristics and exact methods for number partitioning
- Probabilistic analysis of the number partitioning problem
- scientific article; zbMATH DE number 3855168
- Approximation algorithms for semi-random partitioning problems
- Random partitions and Cohen-Lenstra heuristics
- scientific article; zbMATH DE number 3855167
- Optimal multi-way number partitioning
- A complete anytime algorithm for number partitioning
- Random partitions by semigroup methods
Cites work
- A GRASP for a difficult single machine scheduling problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Probabilistic analysis of optimum partitioning
Cited in
(17)- Heuristics and exact methods for number partitioning
- A note on the average-case behavior of a simple differencing method for partitioning
- A complete anytime algorithm for number partitioning
- 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
- Problem space local search for number partitioning
- A two-phase method for multidimensional number partitioning problem
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- scientific article; zbMATH DE number 38085 (Why is no real title available?)
- Fast algorithms for genegrating integer partitions
- Probabilistic analysis of the number partitioning problem
- scientific article; zbMATH DE number 1058049 (Why is no real title available?)
- scientific article; zbMATH DE number 1962846 (Why is no real title available?)
- A random arrival rule for division problems with multiple references
- Simple constant amortized time generation of fixed length numeric partitions
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- The influence of random number generators on graph partitioning algorithms
This page was built for publication: Randomized methods for the number partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563882)