Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Diversification-driven tabu search for unconstrained binary ...
Sort
relevance
views
votes
recent
update
View
thumb
title
152
click to vote
GECCO
2000
Springer
225
views
Optimization
»
more
GECCO 2000
»
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
15 years 8 months ago
Download
www.cs.bham.ac.uk
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »