On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732)
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: On matrices with the Edmonds-Johnson property arising from bidirected graphs |
scientific article; zbMATH DE number 6861269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On matrices with the Edmonds-Johnson property arising from bidirected graphs |
scientific article; zbMATH DE number 6861269 |
Statements
On matrices with the Edmonds-Johnson property arising from bidirected graphs (English)
0 references
18 April 2018
0 references
integer programming
0 references
combinatorial optimization
0 references
strong Chvàtal rank
0 references
Edmonds-Johnson property
0 references
excluded minors
0 references
bidirected graphs
0 references
0 references
0.807453453540802
0 references
0.8065431714057922
0 references
0.7737451791763306
0 references
0.7609981894493103
0 references
