| A Reduction Heuristic For The All-Colors Shortest Path Problem | 0 | 0.34 | 2021 |
| Grocery Distribution Plans In Urban Networks With Street Crossing Penalties | 1 | 0.36 | 2021 |
| Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach | 1 | 0.36 | 2021 |
| The Knapsack Problem with Forfeits. | 0 | 0.34 | 2020 |
| Contrasting The Spread Of Misinformation In Online Social Networks | 1 | 0.35 | 2020 |
| An Adaptive Heuristic Approach To Compute Upper And Lower Bounds For The Close-Enough Traveling Salesman Problem | 0 | 0.34 | 2020 |
| Exact approaches for the orderly colored longest path problem: Performance comparison. | 1 | 0.38 | 2019 |
| Preface: Special issue on network optimization in transportation, logistics, and industry. | 0 | 0.34 | 2019 |
| On the complexity of rainbow spanning forest problem. | 4 | 0.77 | 2018 |
| Preface: Theoretical and algorithmic contributions to network optimization problems. | 0 | 0.34 | 2018 |
| A two-level metaheuristic for the all colors shortest path problem. | 0 | 0.34 | 2018 |
| The rainbow spanning forest problem. | 3 | 0.43 | 2018 |
| The Set Orienteering Problem. | 2 | 0.39 | 2018 |
| An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. | 7 | 0.49 | 2017 |
| Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. | 6 | 0.41 | 2017 |
| Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. | 0 | 0.34 | 2017 |
| Improved Upper And Lower Bounds For The Close Enough Traveling Salesman Problem | 1 | 0.36 | 2017 |
| An exact approach for the grocery delivery problem in urban areas. | 3 | 0.41 | 2017 |
| A novel discretization scheme for the close enough traveling salesman problem. | 8 | 0.57 | 2017 |
| Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms. | 0 | 0.34 | 2017 |
| A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. | 3 | 0.41 | 2017 |
| Carousel greedy: A generalized greedy algorithm with applications in optimization. | 0 | 0.34 | 2017 |
| Prolonging Lifetime In Wireless Sensor Networks With Interference Constraints | 1 | 0.35 | 2017 |
| The Rainbow Cycle Cover Problem | 3 | 0.45 | 2016 |
| OMEGA one multi ethnic genetic approach. | 6 | 0.49 | 2016 |
| Models, algorithms and applications for location problems. | 1 | 0.36 | 2016 |
| Vehicle-ID sensor location for route flow recognition: Models and algorithms. | 6 | 0.51 | 2015 |
| A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints | 12 | 0.51 | 2015 |
| Maximizing lifetime in wireless sensor networks with multiple sensor families | 15 | 0.58 | 2015 |
| Locating sensors to observe network arc flows: Exact and heuristic approaches | 3 | 0.41 | 2014 |
| A memetic algorithm for the weighted feedback vertex set problem | 2 | 0.38 | 2014 |
| Maximizing lifetime and handling reliability in wireless sensor networks | 7 | 0.50 | 2014 |
| A Tabu Search Approach for the Circle Packing Problem | 4 | 0.48 | 2014 |
| Relations, models and a memetic approach for three degree-dependent spanning tree problems. | 12 | 0.63 | 2014 |
| A branch-and-bound algorithm for the double travelling salesman problem with two stacks | 16 | 0.66 | 2013 |
| Lower and upper bounds for the spanning tree with minimum branch vertices | 15 | 0.76 | 2013 |
| Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. | 33 | 1.16 | 2012 |
| The maximum labeled clique problem. | 0 | 0.34 | 2011 |
| A Tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem | 2 | 0.37 | 2011 |
| The labeled maximum matching problem | 11 | 0.56 | 2009 |
| Bounded-degree spanning tree problems: models and new algorithms | 15 | 0.91 | 2009 |
| Efficient preflow push algorithms | 2 | 0.38 | 2008 |
| An Additive Branch-And-Bound Algorithm For The Pickup And Delivery Traveling Salesman Problem With Lifo Or Fifo Loading | 32 | 1.57 | 2007 |
| Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem | 7 | 0.54 | 2006 |
| A linear time algorithm for the minimum weighted feedback vertex set on diamonds | 3 | 0.40 | 2005 |
| Minimum Weighted Feedback Vertex Set on Diamonds | 1 | 0.36 | 2004 |
| Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept | 0 | 0.34 | 2003 |
| Graph Collapsing in Shortest Path Auction Algorithms | 1 | 0.37 | 2001 |
| The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot | 0 | 0.34 | 1998 |
| Mean-variance approach to the management of cyclic deliveries | 1 | 0.43 | 1988 |
