- Algorithms
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Number partitioning

- Algorithms
- >
- Search algorithms
- >
- Combinatorial optimization
- >
- Number partitioning

- Combinatorics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Number partitioning

- Complex systems theory
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- Number partitioning

- Computational complexity theory
- >
- Computational problems
- >
- NP-complete problems
- >
- Number partitioning

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Number partitioning

- Graph theory
- >
- Network theory
- >
- Combinatorial optimization
- >
- Number partitioning

- Mathematical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Number partitioning

- Mathematical problems
- >
- Computational problems
- >
- NP-complete problems
- >
- Number partitioning

- Numerical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Number partitioning

- Operations research
- >
- Network theory
- >
- Combinatorial optimization
- >
- Number partitioning

- Theory of computation
- >
- Computational complexity theory
- >
- NP-complete problems
- >
- Number partitioning

3-partition problem

The 3-partition problem is a strongly NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triplets that all have the same sum

Longest-processing-time-first scheduling

Longest-processing-time-first (LPT) is a greedy algorithm for job scheduling. The input to the algorithm is a set of jobs, each of which has a specific processing-time. There is also a number m specif

Multiway number partitioning

In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums of the subsets are as similar as possible. It

Pseudopolynomial time number partitioning

In computer science, pseudopolynomial time number partitioning is a pseudopolynomial time algorithm for solving the partition problem. The problem can be solved using dynamic programming when the size

Multifit algorithm

The multifit algorithm is an algorithm for multiway number partitioning, originally developed for the problem of identical-machines scheduling. It was developed by Coffman, Garey and Johnson. Its nove

Configuration linear program

The configuration linear program (configuration-LP) is a particular linear programming used for solving combinatorial optimization problems. It was introduced in the context of the cutting stock probl

Balanced number partitioning

Balanced number partitioning is a variant of multiway number partitioning in which there are constraints on the number of items allocated to each set. The input to the problem is a set of n items of d

Identical-machines scheduling

Identical-machines scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on m i

Matroid-constrained number partitioning

Matroid-constrained number partitioning is a variant of the multiway number partitioning problem, in which the subsets in the partition should be independent sets of a matroid. The input to this probl

Partition problem

In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and

Largest differencing method

In computer science, the largest differencing method is an algorithm for solving the partition problem and the multiway number partitioning. It is also called the Karmarkarâ€“Karp algorithm after its in

Greedy number partitioning

In computer science, greedy number partitioning is a class of greedy algorithms for multiway number partitioning. The input to the algorithm is a set S of numbers, and a parameter k. The required outp

Â© 2023 Useful Links.