Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (Q5429286)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5216160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities |
scientific article; zbMATH DE number 5216160 |
Statements
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (English)
0 references
29 November 2007
0 references
approximation algorithms
0 references
integer programming
0 references
polyhedral combinatorics
0 references
randomized algorithms
0 references
scheduling theory and algorithms
0 references
0.994165539741516
0 references
0.9067073464393616
0 references
0.8895184397697449
0 references
0.7963264584541321
0 references
0.7944896221160889
0 references
