A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems (Q466000)
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 6361241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems |
scientific article; zbMATH DE number 6361241 |
Statements
A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems (English)
0 references
24 October 2014
0 references
intractable problem
0 references
polynomial algorithm
0 references
NP-complete problem
0 references
traveling salesman problem
0 references
assignment problem
0 references
solvable subclass of problems
0 references
combinatorial optimization
0 references
matrix of Supnik
0 references
Kalmanson
0 references
Demidenko
0 references
Monge
0 references
0.8152117133140564
0 references
0.7855614423751831
0 references
0.7624862194061279
0 references
