Heuristics and exact methods for number partitioning
From MaRDI portal
Publication:1038378
DOI10.1016/j.ejor.2009.04.027zbMath1173.90518MaRDI QIDQ1038378
Mikio Kubo, João Pedro Pedroso
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.027
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Integer linear programming model for multidimensional two-way number partitioning problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Variable neighborhood descent applied to multi-way number partitioning problem, Variable neighborhood descent branching applied to the multi-way number partitioning problem, Tree search for the stacking problem, A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new modeling and solution approach for the number partitioning problem
- A complete anytime algorithm for number partitioning
- Easily searched encodings for number partitioning
- Number partitioning as a random energy model
- Tight bounds for the identical parallel machine scheduling problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Probabilistic analysis of optimum partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Probabilistic analysis of the number partitioning problem
- Phase Transition in the Number Partitioning Problem
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- Production Planning by Mixed Integer Programming
- Hiding information and signatures in trapdoor knapsacks
- Number partitioning on a quantum computer
