Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on exact algorithms for the bottleneck generalized assignment problem

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

DOI10.1016/0377-2217(95)00056-VzbMath0901.90152OpenAlexW2048837304MaRDI QIDQ1388862

Paolo Toth, Silvano Martello

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00056-v

zbMATH Keywords

branch-and-boundcomputational comparisonbottleneck generalized assignment


Mathematics Subject Classification ID

Integer programming (90C10)


Related Items

A Survey of the Generalized Assignment Problem and Its Applications, Fair task allocation problem, A conditional logic approach for strengthening mixed 0-1 linear programs



Cites Work

  • Unnamed Item
  • An algorithm for the bottleneck generalized assignment problem
  • The bottleneck generalized assignment problem
  • A branch and bound algorithm for the generalized assignment problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1388862&oldid=13539947"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki