Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
DOI10.1016/J.COR.2014.01.003zbMATH Open1348.90545OpenAlexW2129511955MaRDI QIDQ336995FDOQ336995
Authors: Jozef Kratica, Jelena Kojić, Aleksandar Savić 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.01.003
Recommendations
- A two-phase method for multidimensional number partitioning problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
- scientific article; zbMATH DE number 2034558
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
- Integer linear programming model for multidimensional two-way number partitioning problem
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- Title not available (Why is that?)
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- Integer linear programming model for multidimensional two-way number partitioning problem
- Variable neighbourhood search: methods and applications
- An electromagnetism-like mechanism for global optimization
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Computing Partitions with Applications to the Knapsack Problem
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- A complete anytime algorithm for number partitioning
- Gaussian variable neighborhood search for continuous optimization
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- Easily searched encodings for number partitioning
- Randomized methods for the number partitioning problem
- Variable neighborhood search for the vertex separation problem
- Title not available (Why is that?)
- Probabilistic analysis of the number partitioning problem
- Phase Transition in the Number Partitioning Problem
- An electromagnetism-like method for the maximum set splitting problem
Cited In (8)
- Title not available (Why is that?)
- Variable neighborhood descent applied to multi-way number partitioning problem
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
- 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 two-phase method for multidimensional number partitioning problem
- A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem
- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
Uses Software
This page was built for publication: Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336995)
