Advanced search
Publication Cover
IIE Transactions Volume 18, 1986 - Issue 2
Submit an article Journal homepage
65
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

Efficient Algorithms for the Multiconstraint General Knapsack Problem

Hasan Pirkul Academic Faculty of Accounting and Management Information Systems, The Ohio State University, Columbus, Ohio, 43210
&
Sridhar Narasimhan Academic Faculty of Management Sciences, The Ohio State University, Columbus, Ohio, 43210
Pages 195-203 | Received 01 Jul 1985, Published online: 09 Jul 2007

Citations (8)

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)

HASAN PIRKUL. (1989) The Uncapacitated Facility Location Problem With Primary and Secondary Facility Requirements. IIE Transactions 21:4, pages 337-348.
Read now

Articles from other publishers (7)

Bahram Alidaee, Vijay P. Ramalingam, Haibo Wang & Bryan Kethley. (2017) Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem. Annals of Operations Research 269:1-2, pages 3-19.
Crossref
Xiangyong Kong, Liqun Gao, Haibin Ouyang & Steven Li. (2015) Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. Computers & Operations Research 63, pages 7-22.
Crossref
Yalçın Akçay, Haijun Li & Susan H. Xu. (2006) Greedy algorithm for the general multidimensional knapsack problem. Annals of Operations Research 150:1, pages 17-29.
Crossref
Yalçın Akçay & Susan H. Xu. 2005. Applications of Supply Chain Management and E-Commerce Research. Applications of Supply Chain Management and E-Commerce Research 53 86 .
Yalçin Akçay & Susan H. Xu. (2004) Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System. Management Science 50:1, pages 99-116.
Crossref
U.M. Maydell & S. Deng. (1993) A practical method to optimize negotiable call accesses for broadband communication networks. A practical method to optimize negotiable call accesses for broadband communication networks.
A.A. Farley. (1992) Limiting the number of each piece in two-dimensional cutting stock patterns. Mathematical and Computer Modelling 16:1, pages 75-87.
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.