Results 1  10
of
11,151
Analysis of heuristics for number partitioning
 Computational Intelligence
, 1998
"... We illustrate the use of phase transition behavior in the study of heuristics. Using an “annealed ” theory, we define a parameter that measures the “constrainedness ” of an ensemble of number partitioning problems. We identify a phase transition at a critical value of constrainedness. We then show t ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
We illustrate the use of phase transition behavior in the study of heuristics. Using an “annealed ” theory, we define a parameter that measures the “constrainedness ” of an ensemble of number partitioning problems. We identify a phase transition at a critical value of constrainedness. We then show
The Number Partition Phase Transition
 Department of Computer Science, University of Strathclyde, Glasgow
, 1995
"... We identify a natural parameter for random number partitioning, and show that there is a rapid transition between soluble and insoluble problems at a critical value of this parameter. Hard problems are associated with this transition. As is seen in other computational problems, finitesize scaling m ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We identify a natural parameter for random number partitioning, and show that there is a rapid transition between soluble and insoluble problems at a critical value of this parameter. Hard problems are associated with this transition. As is seen in other computational problems, finitesize scaling
MultiWay Number Partitioning
"... The number partitioning problem is to divide a given set of integers into a collection of subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While a very efficient algorithm exists for optimal twoway partitioning, it is not nearly as effective for multiway part ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
The number partitioning problem is to divide a given set of integers into a collection of subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While a very efficient algorithm exists for optimal twoway partitioning, it is not nearly as effective for multi
Optimization by Simulated . . . NUMBER PARTITIONING
, 1991
"... This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain wellstudied domains of combinatorial optimization. Simulated annealing is a randomized technique proposed by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi for improving loca ..."
Abstract
 Add to MetaCart
local optimization algorithms. Here we report on experiments at adapting simulated annealing to graph coloring and number partitioning, two problems for which local optimization had not previously been thought suitable. For graph coloring, we report on three simulated annealing schemes, all of which can
Optimal Number Partitioning
, 1995
"... Given a set of numbers, the twoway partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The problem is NPcomplete, and is contained in many scheduling applications. Based on a polynomialtime heuristic due to Karmark ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set of numbers, the twoway partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The problem is NPcomplete, and is contained in many scheduling applications. Based on a polynomialtime heuristic due
Easily Searched Encodings for Number Partitioning
, 1996
"... Can stochastic search algorithms outperform existing deterministic heuristics for the NPhard problem Number Partitioning if given a sufficient, but practically realizable amount of time? In a thorough empirical investigation using a straightforward implementation of one such algorithm, simulated an ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Can stochastic search algorithms outperform existing deterministic heuristics for the NPhard problem Number Partitioning if given a sufficient, but practically realizable amount of time? In a thorough empirical investigation using a straightforward implementation of one such algorithm, simulated
Heuristics and Exact Methods for Number partitioning
, 2008
"... Number partitioning is a classical NPhard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from branchandbound, breadth first search, and beam search. A new ..."
Abstract
 Add to MetaCart
Number partitioning is a classical NPhard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from branchandbound, breadth first search, and beam search. A new
Probabilistic analysis of the number partitioning problem
 JOURNAL OF PHYSICS A
, 1998
"... Given a sequence of N positive real numbers {a1, a2,..., aN}, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of aj over the two sets is minimized. In the case that the aj’s are statistically independent random va ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Given a sequence of N positive real numbers {a1, a2,..., aN}, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of aj over the two sets is minimized. In the case that the aj’s are statistically independent random
On the distribution of the longest run in number partitions
 RAMANUJAN J
"... We consider the distribution of the longest run of equal elements in number partitions (equivalently, the distribution of the largest gap between subsequent elements); in a recent paper, Mutafchiev proved that the distribution of this random variable (appropriately rescaled) converges weakly. The c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the distribution of the longest run of equal elements in number partitions (equivalently, the distribution of the largest gap between subsequent elements); in a recent paper, Mutafchiev proved that the distribution of this random variable (appropriately rescaled) converges weakly
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
Results 1  10
of
11,151