On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2017.09.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2761271991 / rank | |||
Normal rank | |||
Revision as of 03:18, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On matrices with the Edmonds-Johnson property arising from bidirected graphs |
scientific article |
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
