| Publication | Date of Publication | Type |
|---|
Solving the set covering problem with conflicts on sets: a new parallel GRASP
Computers & Operations Research | 2024-07-08 | Paper |
Corrigendum to: ``A new formulation and a branch-and-cut algorithm for the set orienteering problem
European Journal of Operational Research | 2024-07-02 | Paper |
A new formulation and a branch-and-cut algorithm for the set orienteering problem
European Journal of Operational Research | 2024-04-16 | Paper |
A genetic approach for the 2‐edge‐connected minimum branch vertices problem
Networks | 2024-01-18 | Paper |
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
Networks | 2023-12-11 | Paper |
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
Networks | 2023-12-11 | Paper |
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
A reduction heuristic for the all-colors shortest path problem
RAIRO - Operations Research | 2021-07-27 | Paper |
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network
Optimization Letters | 2021-07-08 | Paper |
The generalized minimum branch vertices problem: properties and polyhedral analysis
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
A biased random-key genetic algorithm for the set orienteering problem
European Journal of Operational Research | 2021-06-07 | Paper |
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
Annals of Operations Research | 2021-05-05 | Paper |
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
INFORMS Journal on Computing | 2021-02-01 | Paper |
Exact approaches for the orderly colored longest path problem: performance comparison
Computers & Operations Research | 2018-12-03 | Paper |
A two-level metaheuristic for the all colors shortest path problem
Computational Optimization and Applications | 2018-11-07 | Paper |
The rainbow spanning forest problem
Soft Computing | 2018-10-22 | Paper |
A novel discretization scheme for the close enough traveling salesman problem
Computers & Operations Research | 2018-07-11 | Paper |
The set orienteering problem
European Journal of Operational Research | 2018-05-30 | Paper |
On the complexity of rainbow spanning forest problem
Optimization Letters | 2018-05-28 | Paper |
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
RAIRO - Operations Research | 2018-02-23 | Paper |
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints
Optimization Letters | 2017-11-09 | Paper |
Maximizing lifetime in wireless sensor networks with multiple sensor families
Computers & Operations Research | 2016-11-10 | Paper |
Lower and upper bounds for the spanning tree with minimum branch vertices
Computational Optimization and Applications | 2013-11-07 | Paper |
A branch-and-bound algorithm for the double travelling salesman problem with two stacks
Networks | 2013-08-06 | Paper |
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
INFORMS Journal on Computing | 2012-06-18 | Paper |
A tabu search heuristic based on \(k\)-diamonds for the weighted feedback vertex set problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
Information Processing Letters | 2009-12-04 | Paper |
The labeled maximum matching problem
Computers & Operations Research | 2009-02-12 | Paper |
Minimum Weighted Feedback Vertex Set on Diamonds
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
