An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00679.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083844949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the Existence of Planning Horizons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3437241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem with Random Sized Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a dynamic resource allocation problem through continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity properties for the stochastic knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Horizon Stochastic Knapsacks with Applications to Yield Management / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:33, 2 July 2024

scientific article
Language Label Description Also known as
English
An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
scientific article

    Statements

    An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (English)
    0 references
    0 references
    0 references
    21 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    stochastic dynamic programming
    0 references
    approximate dynamic programming
    0 references
    simulation
    0 references
    0 references