An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem

Authors:
Milena Bogdanović
Affiliations:
Teacher Training Faculty, University of Niš, Partizanska 14, 17500 Vranje, Serbia
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 5
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Journal of Heuristics
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
Computing the metric dimension of graphs by genetic algorithms

Computational Optimization and Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

A general instance of a Degree-Constrained Subgraph problem may be found in an edge-weighted or vertex-weighted graph G whereas the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This class of combinatorial problems has been extensively studied due to its numerous applications in network design. If the input graph is bipartite, these problems are equivalent to classical transportation and assignment problems in operational research. This paper is an illustration of a research of the NP-hard Maximum Degree-Bounded Connected Subgraph problem (MDBCS). It is a classical NP-complete problem. Moreover this paper offers a first integer linear programming formulation of the (MDBCS), and a formal proof that it is correct. A genetic algorithm for obtaining the optimal solution of (MDBCS) has also been provided. The proposed solution comprises a genetic algorithm (GA) that uses binary representation, fine-grained tournament selection, one-point crossover, simple mutation with frozen genes and caching technique.