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

Bicriteria assignment problems: Complexity estimates and solution algorithms

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

zbMath0905.90149MaRDI QIDQ1390503

Dmitry Kogan

Publication date: 18 October 1998

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)


zbMATH Keywords

NP-completenessassignmentefficient estimatesPareto-optimal solution sets


Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)








This page was built for publication: Bicriteria assignment problems: Complexity estimates and solution algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1390503&oldid=13546008"
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 15:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki