A probabilistic analysis of the multi-period single-sourcing problem
From MaRDI portal
Publication:5946827
DOI10.1016/S0166-218X(00)00320-6zbMath1044.90064MaRDI QIDQ5946827
H. Edwin Romeijn, Dolores Romero Morales
Publication date: 30 July 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probability inequalities for empirical processes and a law of the iterated logarithm
- Multi-criteria analysis with partial information about the weighting coefficients
- On rates of convergence and asymptotic normality in the multiknapsack problem
- Probabilistic analysis of the generalised assignment problem
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- A probabilistic analysis of the capacitated facility location problem
- Designing distribution systems with transport economies of scale
- Sharper bounds for Gaussian and empirical processes
- A class of greedy algorithms for the generalized assignment problem
- A probabilistic feasibility and value analysis of the generalized assignment problem
- A class of generalized greedy algorithms for the multi-knapsack problem
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
- Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
- Generating Experimental Data for the Generalized Assignment Problem
- Multicommodity Distribution System Design by Benders Decomposition
- Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
- An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
- A Concentration Inequality for the K-Median Problem
