New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795)
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 formulations and branch-and-cut procedures for the longest induced path problem |
scientific article; zbMATH DE number 7486440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New formulations and branch-and-cut procedures for the longest induced path problem |
scientific article; zbMATH DE number 7486440 |
Statements
New formulations and branch-and-cut procedures for the longest induced path problem (English)
0 references
9 March 2022
0 references
combinatorial optimization
0 references
integer programming
0 references
longest induced path
0 references
maximum induced subgraphs
0 references
maximum cardinality
0 references
0 references
0 references
0 references
0 references
0 references
0.8574046492576599
0 references
0.8315143585205078
0 references
0.779384195804596
0 references
0.7065651416778564
0 references
0.7055902481079102
0 references
