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

Approximation for multi-knapsack problem

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

zbMath0862.90107MaRDI QIDQ1814715

Luyang Li, Li'ang Zhang, Xiong Huang

Publication date: 25 May 1997

Published in: Chinese Science Bulletin (Search for Journal in Brave)


zbMATH Keywords

polynomial-time approximation algorithmpseudo-polynomial time algorithmmulti-knapsack problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Parallel algorithms in computer science (68W10)


Related Items (1)

Approximation for knapsack problems with multiple constraints







This page was built for publication: Approximation for multi-knapsack problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1814715&oldid=14175910"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki