New approaches to solving discrete programming problems on the basis of lexicographic search (Q333559)
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: New approaches to solving discrete programming problems on the basis of lexicographic search |
scientific article; zbMATH DE number 6645600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approaches to solving discrete programming problems on the basis of lexicographic search |
scientific article; zbMATH DE number 6645600 |
Statements
New approaches to solving discrete programming problems on the basis of lexicographic search (English)
0 references
31 October 2016
0 references
lexicographic order
0 references
lexicographic maximum
0 references
discrete programming problem
0 references
lexicographic search algorithm
0 references
0.8025512099266052
0 references
0.7937313914299011
0 references
0.7810443639755249
0 references
0.7760109305381775
0 references
