scientific article; zbMATH DE number 5666448

MaRDI QIDQ3400313zbMATH OpenFDO

Authors Aleksandar Savić

Publication date 5 February 2010

Full work available at URL https://eudml.org/doc/11363

zbMATH Keywords

betweenness problemgenetic algorithmsnumerical examples

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Recommendations

• Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• Solving extremal problems using genetic algorithms
• A genetic algorithms to solve the bicriteria shortest path problem
• A genetic algorithm for the generalised assignment problem
• A genetic algorithm for the generalised assignment problem
• A genetic algorithm for solving a capacitated \(p\)-median problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Improved genetic algorithm for maximum clique problem

Cited in

(3)

• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• scientific article; zbMATH DE number 5269238 (Why is no real title available?)
• A mixed integer linear programming formulation of the maximum betweenness problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400313)