A probabilistic analysis of the multi-period single-sourcing problem (Q5946827): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Probability inequalities for empirical processes and a law of the iterated logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-criteria analysis with partial information about the weighting coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the generalised assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of a Generalized Bin Packing Problem and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing distribution systems with transport economies of scale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the minimum weighted flowtime scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Concentration Inequality for the <i>K</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of generalized greedy algorithms for the multi-knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic feasibility and value analysis of the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Experimental Data for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of greedy algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharper bounds for Gaussian and empirical processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rates of convergence and asymptotic normality in the multiknapsack problem / rank
 
Normal rank

Revision as of 19:52, 3 June 2024

scientific article; zbMATH DE number 1660384
Language Label Description Also known as
English
A probabilistic analysis of the multi-period single-sourcing problem
scientific article; zbMATH DE number 1660384

    Statements

    A probabilistic analysis of the multi-period single-sourcing problem (English)
    0 references
    0 references
    0 references
    30 July 2002
    0 references
    In the multi-period single-sourcing problem one has to minimize the inventory and transportation costs in an assignment of customers to warehouses such that each customer is assigned to exactly one warehouse in each time period subject to given capacity constraints. The authors investigate a general stochastic model of this task. The probabilistic analysis of the proposed model is given and the theoretical results are empirically illustrated.
    0 references
    0 references
    probabilistic analysis
    0 references
    generalized assignment problem
    0 references
    dynamic assignment problem
    0 references
    0 references
    0 references
    0 references

    Identifiers