A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem

DOI10.1016/j.cor.2020.105133OpenAlexW3100191394MaRDI QIDQ2026995

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

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105133

zbMATH Keywords

combinatorial optimizationmathematical programmingnumber partitioning problemmultidimensional multi-way number partitioning problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem

Uses Software

• ISwR

Cites Work

• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
• Integer linear programming model for multidimensional two-way number partitioning problem
• A complete anytime algorithm for number partitioning
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Computing Partitions with Applications to the Knapsack Problem
• Optimal Multi-Way Number Partitioning
• Reducibility among Combinatorial Problems
• Bounds on Multiprocessing Timing Anomalies
• Introductory Statistics with R