IEEE/ACM Transactions on Networking (TON)
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Journal of Global Optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Discrete Applied Mathematics
Formulations and branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Hypergraphic LP relaxations for steiner trees
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
Hi-index | 0.00 |