Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735)
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: Computing the Pā-hull number of a graph, a polyhedral approach |
scientific article; zbMATH DE number 7027133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach |
scientific article; zbMATH DE number 7027133 |
Statements
Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (English)
0 references
20 February 2019
0 references
combinatorial optimization
0 references
discrete convexity
0 references
Hull number
0 references
facet-defining inequalities
0 references
0 references
0.8286072015762329
0 references
0.820601761341095
0 references
0.8191846609115601
0 references
0.8155672550201416
0 references
0.8120647072792053
0 references
