Lot-sizing on a tree (Q924877)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Lot-sizing on a tree	scientific article

Statements

scholarly article

0 references

Lot-sizing on a tree (English)

0 references

0 references

Laurence A. Wolsey

0 references

Operations Research Letters

0 references

publication date

29 May 2008

0 references

zbMATH Keywords

lot-sizing

0 references

scenario tree

0 references

mixing sets

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.orl.2007.04.007

0 references

The Mixing Set with Flows

0 references

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows

0 references

Lot-sizing on a tree

0 references

Sequential Pairing of Mixed Integer Inequalities

0 references

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

0 references

On formulations of the stochastic uncapacitated lot-sizing problem

0 references

Mixing mixed-integer inequalities

0 references

Tight formulations for some simple mixed integer programs and convex objective integer programs

0 references

Production Planning by Mixed Integer Programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.orl.2007.04.007

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:924877

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