Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models (Q4632846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models |
scientific article; zbMATH DE number 7049559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models |
scientific article; zbMATH DE number 7049559 |
Statements
Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models (English)
0 references
2 May 2019
0 references
lot-sizing
0 references
biobjective
0 references
expenditure
0 references
Pareto efficient outcomes
0 references
complexity analysis
0 references
