Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129511955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete anytime algorithm for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily searched encodings for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized methods for the number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Transition in the Number Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming model for multidimensional two-way number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: Methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood descent with iterated local search for routing and wavelength assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian variable neighborhood search for continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An electromagnetism-like mechanism for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An electromagnetism-like method for the maximum set splitting problem / rank
 
Normal rank

Latest revision as of 21:46, 12 July 2024

scientific article
Language Label Description Also known as
English
Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
scientific article

    Statements

    Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    number partitioning
    0 references
    metaheuristics
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references