Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A population learning algorithm for solving the generalized segregated storage problem

From MaRDI portal
Publication:2776038
Jump to:navigation, search

zbMATH Open0989.68115MaRDI QIDQ2776038FDOQ2776038


Authors: Dariusz Barbucha, Piotr Jedrzejowicz Edit this on Wikidata


Publication date: 28 July 2002





Recommendations

  • Three approximation algorithms for solving the generalized segregated storage problem.
  • PLA-based permutation-scheduling
  • Population learning algorithm for the resource-constrained project scheduling
  • Artificial Intelligence and Soft Computing - ICAISC 2004
  • The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach


zbMATH Keywords

generalized segregated storage problem


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)



Cited In (1)

  • Three approximation algorithms for solving the generalized segregated storage problem.





This page was built for publication: A population learning algorithm for solving the generalized segregated storage problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2776038&oldid=15660871"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 14:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki