A class of polynomially solvable 0-1 programming problems and an application (Q547367)
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: A class of polynomially solvable 0-1 programming problems and an application |
scientific article; zbMATH DE number 5916794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of polynomially solvable 0-1 programming problems and an application |
scientific article; zbMATH DE number 5916794 |
Statements
A class of polynomially solvable 0-1 programming problems and an application (English)
0 references
1 July 2011
0 references
0-1 programming
0 references
polynomial-time algorithms
0 references
supply chain management
0 references
0 references
0 references
0.7181444764137268
0 references
0.7171154022216797
0 references
0.7119804620742798
0 references
