A complete anytime algorithm for number partitioning
From MaRDI portal
Publication:1277696
DOI10.1016/S0004-3702(98)00086-1zbMath0910.68084OpenAlexW2090865599WikidataQ59649942 ScholiaQ59649942MaRDI QIDQ1277696
Publication date: 2 March 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00086-1
Related Items
Variable neighborhood descent branching applied to the multi-way number partitioning problem ⋮ Weighted \(A^*\) search - unifying view and application ⋮ 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 ⋮ Lattice-based algorithms for number partitioning in the hard phase ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Integer linear programming model for multidimensional two-way number partitioning problem ⋮ The paired mail carrier problem ⋮ An algebraic expression of the number partitioning problem ⋮ On optimization of finite-difference time-domain (FDTD) computation on heterogeneous and GPU clusters ⋮ Computer-assisted proof of performance ratios for the differencing method ⋮ Privacy-preserved distinct content collection in human-assisted ubiquitous computing systems ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Another look at the phenomenon of phase transition ⋮ Block rearranging elements within matrix columns to minimize the variability of the row sums ⋮ Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble ⋮ Number partitioning on a quantum computer ⋮ A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem ⋮ A splitting method for stochastic programs ⋮ A physicist's approach to number partitioning ⋮ Variable neighborhood descent applied to multi-way number partitioning problem ⋮ A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem ⋮ The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces ⋮ Genetic algorithms as a tool for structuring collaborative groups ⋮ Unnamed Item ⋮ Heuristics and exact methods for number partitioning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Easily searched encodings for number partitioning
- A study of complexity transitions on the asymmetric traveling salesman problem
- Probabilistic analysis of optimum partitioning
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Computing Partitions with Applications to the Knapsack Problem
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
