A branch and bound algorithm for the acyclic subgraph problem (Q1154950)
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: A branch and bound algorithm for the acyclic subgraph problem |
scientific article; zbMATH DE number 3729895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the acyclic subgraph problem |
scientific article; zbMATH DE number 3729895 |
Statements
A branch and bound algorithm for the acyclic subgraph problem (English)
0 references
1981
0 references
branch and bound algorithm
0 references
acyclic subgraph problem
0 references
feedback arc set problem
0 references
heuristic algorithm
0 references
lexicographic enumeration
0 references
