Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
From MaRDI portal
(Redirected from Publication:336995)
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
- Publication:4445233
- 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
Cites work
- scientific article; zbMATH DE number 5504153 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A complete anytime algorithm for number partitioning
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- An electromagnetism-like mechanism for global optimization
- An electromagnetism-like method for the maximum set splitting problem
- Computing Partitions with Applications to the Knapsack Problem
- Easily searched encodings for number partitioning
- Gaussian variable neighborhood search for continuous optimization
- Integer linear programming model for multidimensional two-way number partitioning problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Phase Transition in the Number Partitioning Problem
- Probabilistic analysis of the number partitioning problem
- Randomized methods for the number partitioning problem
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Variable neighborhood search
- Variable neighborhood search for the vertex separation problem
- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
Cited in
(8)- New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
- A mixed-integer linear programming model to solve the multidimensional multi-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
- scientific article; zbMATH DE number 2034558 (Why is no real title available?)
- A two-phase method for multidimensional number partitioning problem
- Variable neighborhood descent applied to multi-way number partitioning problem
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
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)