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

scientific article; zbMATH DE number 1839478

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

zbMATH Open1003.90034MaRDI QIDQ4782747

Monaldo Mastrolilli

Publication date: 2 December 2002


Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2138/21380525

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


zbMATH Keywords

knapsack problempolynomial time approximation schemelinear complexity bound


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)



Related Items (1)

Hybrid rounding techniques for knapsack problems






This page was built for publication:

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