Variable neighborhood descent applied to multi-way number partitioning problem

DOI10.1016/j.endm.2018.03.014zbMath1408.90342OpenAlexW2797964075MaRDI QIDQ1791923

Alexandre Frias Faria, Carlos Alexandre Silva, Sérgio Ricardo de Souza

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.014

zbMATH Keywords

combinatorial optimizationmetaheuristicmulti-way number partitioning problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Variable neighborhood descent branching applied to the multi-way number partitioning problem

Cites Work

• Unnamed Item
• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
• Heuristics and exact methods for number partitioning
• A complete anytime algorithm for number partitioning
• Variable neighborhood decomposition search
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Variable neighborhood descent applied to multi-way number partitioning problem