A new modeling and solution approach for the number partitioning problem
From MaRDI portal
Publication:930774
DOI10.1155/JAMDS.2005.113zbMath1172.90511MaRDI QIDQ930774
Gary A. Kochenberger, Fred Glover, Bahram Alidaee, César Rego
Publication date: 1 July 2008
Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130728
Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Building an iterative heuristic solver for a quantum annealer ⋮ QUBO formulations of the longest path problem ⋮ Solving the maximum edge weight clique problem via unconstrained quadratic programming ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Integer linear programming model for multidimensional two-way number partitioning problem ⋮ An algebraic expression of the number partitioning problem ⋮ An effective modeling and solution approach for the generalized independent set problem ⋮ A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria ⋮ Heuristics and exact methods for number partitioning
