An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336)
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: An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem |
scientific article; zbMATH DE number 5775099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem |
scientific article; zbMATH DE number 5775099 |
Statements
An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (English)
0 references
26 August 2010
0 references
connected subgraph
0 references
combinatorial optimization
0 references
integer linear programming
0 references
genetic algorithm
0 references
0 references
0 references
0 references
0 references
