Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10479-011-0871-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975822508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-resource allocation problem with Poisson resource requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for the general multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combined Vehicle Routing and Inventory Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Allocation and Distribution Model for Perishable Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programs with Complicating Variables: Theoretical Analysis and Numerical Experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic ordering decisions with market choice flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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: Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Optimal Inventories Based on Job Completion Rate for Repairs Requiring Multiple Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target market selection and marketing effort under uncertainty: the selective newsvendor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventory control of service parts in the final phase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventory control of service parts in the final phase: A central depot and repair kits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 17:25, 6 July 2024

scientific article
Language Label Description Also known as
English
Optimal allocation of stock levels and stochastic customer demands to a capacitated resource
scientific article

    Statements

    Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (English)
    0 references
    0 references
    8 August 2013
    0 references
    stochastic resource allocation
    0 references
    generalized Benders decomposition
    0 references
    Lagrangian relaxation
    0 references
    mixed integer nonlinear optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers