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

On equivalent knapsack problems

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

DOI10.1016/0166-218X(86)90030-2zbMath0602.90103MaRDI QIDQ1082265

B. George

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

knapsack problemcorner polyhedronaggregating objective function and constraintgroup knapsack


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39)


Related Items (4)

On aggregating two linear diophantine equations ⋮ An exact algorithm for large unbounded knapsack problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ A relation between the knapsack and group knapsack problems



Cites Work

  • Unnamed Item
  • Unnamed Item


This page was built for publication: On equivalent knapsack problems

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