Solving knapsack problems with S-curve return functions

We consider the allocation of a limited budget to a set of activities or investments in order to maximize return from investment. In a number of practical contexts (e.g., advertising), the return from investment in an activity is effectively modeled using an S-curve, where increasing returns to scal...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 193; číslo 2; s. 605 - 615
Hlavní autoři:	Ağralı, Semra, Geunes, Joseph
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.03.2009 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Algorithms Allocations Applied sciences Approximation Dynamic programming Exact sciences and technology Firm modelling Flows in networks. Combinatorial problems Integer programming Knapsack problem Marketing Non-linear programming Non-linear programming OR in strategic planning Dynamic programming Marketing Operational research and scientific management Operational research. Management science OR in strategic planning Return on investment Studies OR in strategic planning Dynamic programming Non-linear programming Marketing Polynomial approximation Strategic planning Non linear programming Polynomial method Approximation algorithm Modeling Knapsack problem Polynomial time Return to scale Efficiency NP hard problem Problem solving Budget Advertising Investment
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!