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

Solving assignment problem based on a mixed algorithm

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

zbMATH Open1212.90251MaRDI QIDQ3052385FDOQ3052385


Authors: Xiaolei Wen, Pengtao Wang Edit this on Wikidata


Publication date: 5 November 2010





Recommendations

  • Genetic algorithm approach for solving the task assignment problem
  • Un algoritmo misto per il problema dell'assegnazione pluridimensionale
  • Genetic algorithm for linear and cyclic assignment problem
  • scientific article; zbMATH DE number 1960697
  • A genetic algorithm for the generalised assignment problem


zbMATH Keywords

combinatorial optimizationassignment problemgenetic algorithmant colony algorithm


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)



Cited In (5)

  • A model and an algorithm for the task assignment problem in product data management
  • Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
  • Combining solutions of the axial assignment problem
  • Solving assignment problems using best job method
  • Approach to finding the optimal solution in the assignment problem





This page was built for publication: Solving assignment problem based on a mixed algorithm

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

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