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

DOI10.1016/J.COR.2004.03.020zbMATH Open1068.90093OpenAlexW2083764142MaRDI QIDQ2387288FDOQ2387288

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2177315
• Exact Algorithms for Generalized Combinatorial Optimization Problems
• scientific article; zbMATH DE number 780787
• A parallel algorithm for constrained optimization problems
• On Approximate Solutions for Combinatorial Optimization Problems
• Towards Copeland optimization in combinatorial problems
• scientific article; zbMATH DE number 1382333
• scientific article; zbMATH DE number 2086995
• Solving combinatorial optimization problems in parallel: methods and techniques
• An integral simplex algorithm for solving combinatorial optimization problems

zbMATH Keywords

Hopfield neural networksGenetic algorithmsCombinatorial optimizationPortabilityScalabilityHybrid algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Tabu search for frequency assignment in mobile radio networks
• Title not available (Why is that?)
• Guided genetic algorithm and its application to radio link frequency assignment problems
• Application of a hybrid genetic algorithm to airline crew scheduling
• A hybrid neural approach to combinatorial optimization
• Title not available (Why is that?)

Cited In (4)

• A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications
• On the performance of the LP-guided Hopfield network-genetic algorithm
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387288)