Algorithmic upper bounds for graph geodetic number
Year of publication: |
2022
|
---|---|
Authors: | Anaqreh, Ahmad T. ; G.-Tóth, Boglárka ; Vinkó, Tamás |
Subject: | Geodetic number | Greedy heuristic | Integer linear programming | Upper bound | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Graphentheorie | Graph theory |
-
Benavent, Enrique, (2023)
-
An algorithm and upper bounds for the weighted maximal planar graph problem
Ahmadi-Javid, Amir, (2015)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
- More ...
-
Vinkó, Tamás, (2007)
-
Efficient interval partitioning for constrained global optimization
Pedamallu, Chandra Sekhar, (2008)
-
A New Inclusion Function for Optimization: Kite #8211 The One Dimensional Case
Vinkó, Tamás, (2004)
- More ...