An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem

DOI10.1016/j.camwa.2010.02.021zbMath1193.90177OpenAlexW1988141857MaRDI QIDQ988336

Milena Bogdanović

Publication date: 26 August 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.02.021

zbMATH Keywords

combinatorial optimizationgenetic algorithminteger linear programmingconnected subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Computing the metric dimension of graphs by genetic algorithms
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• Genetic algorithms for solving the discrete ordered median problem
• Matching theory
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• The core concept for the Multidimensional Knapsack problem
• Color-coding
• Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
• Degree Conditions and Degree Bounded Trees
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem