A complete anytime algorithm for number partitioning
From MaRDI portal
Recommendations
Cites work
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- A study of complexity transitions on the asymmetric traveling salesman problem
- Computing Partitions with Applications to the Knapsack Problem
- Easily searched encodings for number partitioning
- scientific article; zbMATH DE number 4174360 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (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
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
Cited in
(45)- Heuristics and exact methods for number partitioning
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Variable neighborhood descent applied to multi-way number partitioning problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- Easily searched encodings for number partitioning
- Problem space local search for number partitioning
- Lattice-based algorithms for number partitioning in the hard phase
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
- Variable neighborhood descent branching applied to the multi-way number partitioning problem
- An algebraic expression of the number partitioning problem
- Privacy-preserved distinct content collection in human-assisted ubiquitous computing systems
- Genetic algorithms as a tool for structuring collaborative groups
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A splitting method for stochastic programs
- The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
- Randomized methods for the number partitioning problem
- scientific article; zbMATH DE number 5812481 (Why is no real title available?)
- Heuristic search under contract
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Deterministic learning automata solutions to the equipartitioning problem
- Fast algorithms for genegrating integer partitions
- Computer-assisted proof of performance ratios for the differencing method
- scientific article; zbMATH DE number 1472145 (Why is no real title available?)
- Optimal multi-way number partitioning
- Simple constant amortized time generation of fixed length numeric partitions
- scientific article; zbMATH DE number 1439398 (Why is no real title available?)
- Another look at the phenomenon of phase transition
- scientific article; zbMATH DE number 2230249 (Why is no real title available?)
- Number partitioning on a quantum computer
- A physicist's approach to number partitioning
- The paired mail carrier problem
- On some similarity of finite sets (and what we can say today about certain old problem)
- Integer linear programming model for multidimensional two-way number partitioning problem
- On optimization of finite-difference time-domain (FDTD) computation on heterogeneous and GPU clusters
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- Almost proportional allocations of indivisible chores: computation, approximation and efficiency
- Partially ordered sets corresponding to the partition problem
- Reactive synthesis for expected impacts
- FPT approximation for fair minimum-load clustering
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
- Improved block rearrangement algorithm
- Equal treatment and its market design implications
- Weighted A^* search - unifying view and application
- Performance ratios of the Karmarkar-Karp differencing method
This page was built for publication: A complete anytime algorithm for number partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277696)
