Problem space local search for number partitioning

DOI10.1007/BF02156630zbMath0851.90100OpenAlexW1990425868MaRDI QIDQ1919856

S. David Wu, Seth W. Flanders, Robert H. Storer

Publication date: 18 September 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02156630

zbMATH Keywords

metaheuristicsgenetic algorithmslocal searchnumber partitioningproblem space approach

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (5)

Performance ratios of the Karmarkar-Karp differencing method ⋮ Metaheuristics: A bibliography ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic heuristic for a computationally difficult set covering problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

This page was built for publication: Problem space local search for number partitioning