| Publication | Date of Publication | Type |
|---|
Revisiting search methods for the bounded-diameter minimum spanning tree problem
RAIRO. Operations Research | 2026-02-23 | Paper |
Formulations and algorithms for the simple cycle problem
Computational Optimization and Applications | 2026-01-19 | Paper |
| Minimum concurrency for assembling computer music | 2025-10-30 | Paper |
Optimizing concurrency under Scheduling by Edge Reversal
Networks | 2023-12-11 | Paper |
Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem
International Transactions in Operational Research | 2023-11-27 | Paper |
A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem
RAIRO - Operations Research | 2021-07-27 | Paper |
An ILS-based heuristic applied to the car renter salesman problem
RAIRO - Operations Research | 2021-07-27 | Paper |
New proposals for modelling and solving the problem of covering solids using spheres of different radii
RAIRO - Operations Research | 2020-05-13 | Paper |
A new formulation for the safe set problem on graphs
Computers & Operations Research | 2019-09-25 | Paper |
Distance transformation for network design problems
SIAM Journal on Optimization | 2019-08-27 | Paper |
Spanning trees with a constraint on the number of leaves. A new formulation
Computers & Operations Research | 2018-07-11 | Paper |
A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
Computers & Operations Research | 2016-11-17 | Paper |
| A hybrid heuristic based on iterated local search for multivehicle inventory routing problem | 2016-10-18 | Paper |
| A strong symmetric formulation for the min-degree constrained minimum spanning tree problem | 2016-10-18 | Paper |
| The tree-star problem: a formulation and a branch-and-cut algorithm | 2016-10-18 | Paper |
On solving manufacturing cell formation via bicluster editing
European Journal of Operational Research | 2016-10-07 | Paper |
Optimality cuts and a branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
European Journal of Operational Research | 2016-10-06 | Paper |
Lagrangian heuristics for the quadratic knapsack problem
Computational Optimization and Applications | 2016-03-07 | Paper |
Hybrid heuristics for a short sea inventory routing problem
European Journal of Operational Research | 2015-02-03 | Paper |
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
INFORMS Journal on Computing | 2015-01-26 | Paper |
Integer programming approaches for minimum stabbing problems
RAIRO - Operations Research | 2014-05-26 | Paper |
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
Hop-level flow formulation for the survivable network design with hop constraints problem
Networks | 2013-08-06 | Paper |
New branch-and-bound algorithms for k-cardinality tree problems
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Upper and lower bounding procedures for the minimum caterpillar spanning problem
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
Discrete Applied Mathematics | 2011-10-27 | Paper |
Hop-level flow formulation for the hop constrained survivable network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Computational Management Science | 2010-09-20 | Paper |
Bilevel optimization applied to strategic pricing in competitive electricity markets
Computational Optimization and Applications | 2008-04-03 | Paper |
