Approximate solution of a profit maximization constrained virtual business planning problem

Abstract : A virtual business problem is studied, in which a company-contractor outsources production to specialized subcontractors. Finances of the contractor and resource capacities of subcontractors are limited. The objective is to select subcontractors and distribute a part of the demanded production among them so that the profit of the contractor is maximized. A generalization of the knapsack problem, called Knapsack-of-Knapsacks (K-of-K), is used to model this situation, in which items have to be packed into small knapsacks and small knapsacks have to be packed into a large knapsack. A fully polynomial time approximation scheme is developed to solve the problem K-of-K.
Document type :
Journal articles
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-01250964
Contributor : Florent Breuil <>
Submitted on : Tuesday, January 5, 2016 - 2:37:41 PM
Last modification on : Thursday, October 17, 2019 - 12:36:12 PM

Identifiers

Citation

Alexandre Dolgui, Sergey Kovalev, Erwin Pesch. Approximate solution of a profit maximization constrained virtual business planning problem. Omega, Elsevier, 2015, 57 (Part B), pp 212-216. ⟨10.1016/j.omega.2015.05.001⟩. ⟨emse-01250964⟩

Share

Metrics

Record views

214