| The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms | 0 | 0.34 | 2021 |
| Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem. | 0 | 0.34 | 2020 |
| Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the Adjacent Only Quadratic Minimum Spanning Tree Problem | 0 | 0.34 | 2020 |
| Modeling and solving the angular constrained minimum spanning tree problem. | 1 | 0.35 | 2019 |
| Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. | 0 | 0.34 | 2019 |
| Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem. | 0 | 0.34 | 2018 |
| Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem. | 1 | 0.35 | 2018 |
| Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem. | 0 | 0.34 | 2018 |
| Optimally solving the joint order batching and picker routing problem. | 9 | 0.52 | 2017 |
| The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm | 3 | 0.43 | 2016 |
| A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem | 0 | 0.34 | 2016 |
| A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game | 2 | 0.36 | 2016 |
| Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem | 4 | 0.45 | 2016 |
| Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem. | 0 | 0.34 | 2015 |
| A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem | 10 | 0.49 | 2015 |
| Formulations and exact solution approaches for the degree preserving spanning tree problem | 0 | 0.34 | 2015 |
| Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem | 5 | 0.44 | 2015 |
| Lower bounds and exact algorithms for the quadratic minimum spanning tree problem | 6 | 0.48 | 2015 |
| Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem | 23 | 0.99 | 2014 |
| Finding Totally Independent Spanning Trees with Linear Integer Programming. | 0 | 0.34 | 2014 |
| The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm. | 5 | 0.51 | 2014 |
| Formulating and Solving the Minimum Dominating Cycle Problem. | 0 | 0.34 | 2013 |
| The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. | 2 | 0.38 | 2013 |
| A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem. | 5 | 0.46 | 2013 |
| The Pickup and Delivery Problem with Cross-Docking | 17 | 0.61 | 2013 |
| Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem. | 14 | 0.52 | 2013 |
| A New Formulation and Computational Results for the Simple Cycle Problem. | 1 | 0.40 | 2013 |
| Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs. | 8 | 0.54 | 2013 |
| Polyhedral results and a Branch-and-cut algorithm for the \(k\) -cardinality tree problem | 0 | 0.34 | 2013 |
| A parallel lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem | 1 | 0.36 | 2012 |
| Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks | 14 | 0.56 | 2011 |
| A novel column generation algorithm for the vehicle routing problem with cross-docking | 9 | 0.48 | 2011 |
| Formulations and branch-and-cut algorithm for the k-rooted mini-max spanning forest problem | 1 | 0.41 | 2011 |
| A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. | 13 | 0.57 | 2011 |
| Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. | 1 | 0.36 | 2011 |
| The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm | 13 | 0.74 | 2011 |
| Heuristic and exact algorithms for a min-max selective vehicle routing problem | 10 | 0.56 | 2011 |
| A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem | 4 | 0.50 | 2010 |
| The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation | 5 | 0.49 | 2010 |
| Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm | 4 | 0.47 | 2010 |
| The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks | 3 | 0.49 | 2009 |
| Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized | 2 | 0.41 | 2009 |
| A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs | 26 | 1.11 | 2009 |
| Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks | 3 | 0.46 | 2008 |
| Integer Programming Formulations for the k-Cardinality Tree Problem | 3 | 0.48 | 2008 |
| Stronger upper and lower bounds for a hard batching problem to feed assembly lines | 1 | 0.35 | 2008 |
| Lower and upper bounds for the degree-constrained minimum spanning tree problem | 13 | 0.86 | 2007 |
| Algorithms for the degree-constrained minimum spanning tree problem | 0 | 0.34 | 2005 |
