Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 88, 2011 - Issue 16
Submit an article Journal homepage
133
Views
4
CrossRef citations to date
0
Altmetric
Section A

An exact algorithm for the budget-constrained multiple knapsack problem

Byungjun You Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa, 239-8686, JapanCorrespondence[email protected]
View further author information
&
Takeo Yamada Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa, 239-8686, Japan
Pages 3380-3393 | Received 29 Oct 2010, Accepted 26 Jul 2011, Published online: 26 Sep 2011

Citations (4)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Md. Noor-E-Alam & John Doucette. (2015) Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques. Engineering Optimization 47:8, pages 1085-1106.
Read now

Articles from other publishers (3)

Yawen Liu & Dazhi Pan. (2024) A multi-neighborhood tabu search for solving multi-budget maximum coverage problem. Applied Soft Computing 153, pages 111299.
Crossref
Valentina Cacchiani, Manuel Iori, Alberto Locatelli & Silvano Martello. (2022) Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Computers & Operations Research 143, pages 105693.
Crossref
Kuen-Fang JeaJen-Ya WangChih-Wei Hsu. (2019) Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit. Asia-Pacific Journal of Operational Research 36:03, pages 1950014.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.