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

DOI10.1016/j.entcs.2019.08.039OpenAlexW2977453155WikidataQ113317393 ScholiaQ113317393MaRDI QIDQ2132377

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

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.039

zbMATH Keywords

combinatorial optimizationmatheuristicsmulti-way number partitioning problemvariable neighborhood descent branching

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Uses Software

• CPLEX

Cites Work

• Heuristics and exact methods for number partitioning
• A complete anytime algorithm for number partitioning
• Local branching
• Variable neighborhood descent applied to multi-way number partitioning problem
• Reducibility among Combinatorial Problems
• Bounds for Certain Multiprocessing Anomalies

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