Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging - MaRDI portal

A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging	scientific article

Statements

scholarly article

0 references

A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (English)

0 references

0 references

Andrew J. Miller

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

10 June 2008

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-68891-4_31

0 references

Improved Algorithms for Economic Lot Size Problems

0 references

A multi-stage stochastic integer programming approach for capacity expansion under uncertainty

0 references

An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion

0 references

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

0 references

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

0 references

A branch and bound method for stochastic integer problems under probabilistic constraints

0 references

L-shaped decomposition of two-stage stochastic programs with integer recourse

0 references

A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

0 references

0 references

Deterministic Production Planning with Concave Costs and Capacity Constraints

0 references

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem

0 references

Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems

0 references

A Dynamic Lot-Sizing Model with Demand Time Windows

0 references

A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

0 references

0 references

Production Planning by Mixed Integer Programming

0 references

0 references

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming

0 references

Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

0 references

Lot-sizing on a tree

0 references

A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

0 references

An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

0 references

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-68891-4_31

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503865

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3503865&oldid=35059757"