Skip to Main Content

Advertisement

Umbrella Alt Text
header search
Search
Advanced Search
Skip Nav Destination

On Local Search for Bi-objective Knapsack Problems

Evolutionary Computation (2013) 21 (1): 179–196.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Landscape-Aware Performance Prediction for Evolutionary Multiobjective Optimization
  • Arnaud Liefooghe
  • Fabio Daolio
  • Sebastien Verel
  • Bilel Derbel
  • Hernan Aguirre
  • Kiyoshi Tanaka
IEEE Transactions on Evolutionary Computation (2020) 24 (6): 1063.
Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes
  • Fabio Daolio
  • Arnaud Liefooghe
  • Sébastien Verel
  • Hernán Aguirre
  • Kiyoshi Tanaka
Evolutionary Computation (2017) 25 (4): 555.
An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics
  • George Mavrotas
  • Kostas Florios
  • José Rui Figueira
Applied Mathematics and Computation (2015) 270: 25.
On a biobjective search problem in a line: Formulations and algorithms
  • Luís Paquete
  • Mathias Jaschob
  • Kathrin Klamroth
  • Jochen Gorski
Theoretical Computer Science (2013) 507: 61.

Advertisement

  • Online ISSN 1530-9304
  • Print ISSN 1063-6560
A product of The MIT Press
Newsletter Sign Up

MIT Press Direct

Information

MIT Press

Contact Us

© 2023 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept