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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem

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

DOI10.1080/02331938308842893zbMath0542.90069OpenAlexW2084038215MaRDI QIDQ3330975

Stephan Dempe

Publication date: 1983

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938308842893


zbMATH Keywords

nonconvex optimizationpolynomial algorithmsaverage-case behaviourdiscontinuous linear knapsack problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11)








This page was built for publication: Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem

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