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.
Type de document :
Article dans une revue
Omega, Elsevier, 2015, 57 (Part B), pp 212-216. 〈10.1016/j.omega.2015.05.001〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01250964
Contributeur : Florent Breuil <>
Soumis le : mardi 5 janvier 2016 - 14:37:41
Dernière modification le : mardi 23 octobre 2018 - 14:36:09

Identifiants

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〉

Partager

Métriques

Consultations de la notice

162