Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
type: Item
instance of: scholarly article
title: Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
zbMATH Open document ID: 1348.90545
author: Jozef Kratica
author: Jelena Kojić
author: Aleksandar Savić
published in: Computers \& Operations Research
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05A17
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6650655
zbMATH Keywords: number partitioning
zbMATH Keywords: metaheuristics
zbMATH Keywords: combinatorial optimization
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2014.01.003
OpenAlex ID: W2129511955
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: A complete anytime algorithm for number partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Easily searched encodings for number partitioning
cites work: Randomized methods for the number partitioning problem
cites work: Q4354785
cites work: Probabilistic analysis of the number partitioning problem
cites work: Phase Transition in the Number Partitioning Problem
cites work: Q3597151
cites work: Integer linear programming model for multidimensional two-way number partitioning problem
cites work: A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
cites work: Variable neighborhood search
cites work: Variable neighbourhood search: Methods and applications
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood descent with iterated local search for routing and wavelength assignment
cites work: Variable neighborhood search for the vertex separation problem
cites work: Gaussian variable neighborhood search for continuous optimization
cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
cites work: An electromagnetism-like mechanism for global optimization
cites work: An electromagnetism-like method for the maximum set splitting problem
DOI: 10.1016/J.COR.2014.01.003
Recommended article: A two-phase method for multidimensional number partitioning problem
Recommended article: A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
Recommended article: A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
Recommended article: Q4445233
Recommended article: A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
Recommended article: Integer linear programming model for multidimensional two-way number partitioning problem
Recommended article: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
Recommended article: New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
Recommended article: GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
description: scientific article; zbMATH DE number 6650655