The k-allocation problem and its variants
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
32-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
Operations Research Letters
The minimum spanning tree problem with conflict constraints and its variations
Discrete Optimization
The k-path tree matroid and its applications to survivable network design
Discrete Optimization
Color constrained combinatorial optimization problems
Operations Research Letters
| Hi-index | 0.00 |