A portable and scalable algorithm for a class of constrained combinatorial optimization problems

DOI10.1016/J.COR.2004.03.020zbMath1068.90093OpenAlexW2083764142MaRDI QIDQ2387288

Carlos Bousoño-Calzón, Sancho Salcedo-Sanz

Publication date: 2 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.020

zbMATH Keywords

Genetic algorithmsCombinatorial optimizationHopfield neural networksScalabilityPortabilityHybrid algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

A survey of repair methods used as constraint handling techniques in evolutionary algorithms ⋮ On the performance of the LP-guided Hopfield network-genetic algorithm

Cites Work

• Application of a hybrid genetic algorithm to airline crew scheduling
• A hybrid neural approach to combinatorial optimization
• Tabu search for frequency assignment in mobile radio networks
• Guided genetic algorithm and its application to radio link frequency assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A portable and scalable algorithm for a class of constrained combinatorial optimization problems