Improved randomized approximation algorithms for lot-sizing problems (Q4645935): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1007/3-540-61310-2_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1596341019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing Policies for Finite Production Rate Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear formulations and improved randomized approximation algorithms for multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Power-of-Two Replenishment Strategies in Capacitated General Production/Distribution Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Procedures for the One-Warehouse Multi-Retailer System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:57, 17 July 2024

scientific article; zbMATH DE number 7000361
Language Label Description Also known as
English
Improved randomized approximation algorithms for lot-sizing problems
scientific article; zbMATH DE number 7000361

    Statements

    Improved randomized approximation algorithms for lot-sizing problems (English)
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    approximation algorithm
    0 references
    base period
    0 references
    improve approximation algorithm
    0 references
    optimal stationary policy
    0 references
    joint replenishment problem
    0 references
    0 references

    Identifiers