| Publication | Date of Publication | Type |
|---|
Kidney exchanges with desensitization and orphans: a matheuristic approach
SN Operations Research Forum | 2026-03-17 | Paper |
Exact and heuristic solution approaches for the cluster deletion problem on general graphs
Networks | 2025-06-13 | Paper |
Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
European Journal of Operational Research | 2025-05-20 | Paper |
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 |
Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides
Journal of Optimization Theory and Applications | 2024-01-08 | Paper |
Grocery distribution plans in urban networks with street crossing penalties
Networks | 2023-12-11 | Paper |
Shortest paths with exclusive-disjunction arc pairs conflicts
Computers & Operations Research | 2023-07-04 | 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 |
An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation
Computers & Operations Research | 2022-03-09 | Paper |
A reduction heuristic for the all-colors shortest path problem
RAIRO - Operations Research | 2021-07-27 | Paper |
The generalized minimum branch vertices problem: properties and polyhedral analysis
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
Annals of Operations Research | 2021-05-05 | Paper |
| The knapsack problem with forfeits | 2021-02-04 | 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 |
Contrasting the spread of misinformation in online social networks
Journal of Artificial Intelligence Research | 2020-12-09 | Paper |
Operations management in distribution networks within a smart city framework
IMA Journal of Management Mathematics | 2019-09-25 | 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 branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Computers & Operations Research | 2018-07-11 | Paper |
A novel discretization scheme for the close enough traveling salesman problem
Computers & Operations Research | 2018-07-11 | Paper |
Carousel greedy: a generalized greedy algorithm with applications in optimization
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 |
The rainbow cycle cover problem
Networks | 2018-05-23 | 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 |
Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
Asia-Pacific Journal of Operational Research | 2017-11-30 | 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 |
Locating sensors to observe network arc flows: exact and heuristic approaches
Computers & Operations Research | 2016-11-10 | Paper |
Vehicle-ID sensor location for route flow recognition: models and algorithms
European Journal of Operational Research | 2016-10-06 | Paper |
OMEGA one multi ethnic genetic approach
Optimization Letters | 2016-03-04 | Paper |
Comparison of heuristics for the colourful travelling salesman problem
International Journal of Metaheuristics | 2015-02-23 | Paper |
Relations, models and a memetic approach for three degree-dependent spanning tree problems
European Journal of Operational Research | 2015-02-18 | 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 |
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
European Journal of Operational Research | 2012-12-29 | 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 |
Bounded-degree spanning tree problems: models and new algorithms
Computational Optimization and Applications | 2011-03-24 | 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 |
Efficient preflow push algorithms
Computers & Operations Research | 2008-02-22 | Paper |
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Minimum Weighted Feedback Vertex Set on Diamonds
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Shortest path auction algorithm without contractions using virtual source concept
Computational Optimization and Applications | 2003-12-04 | Paper |
Graph collapsing in shortest path auction algorithms
Computational Optimization and Applications | 2001-12-16 | Paper |
| scientific article; zbMATH DE number 1560338 (Why is no real title available?) | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1424207 (Why is no real title available?) | 2000-06-07 | Paper |
A multiplier adjustment technique for the capacitated concentrator location problem
Optimization Methods & Software | 1999-07-27 | Paper |
The auction technique for the sensor based navigation planning of an autonomous mobile robot
Journal of Intelligent & Robotic Systems | 1998-05-25 | Paper |
A class of manpower scheduling problems
ZOR Zeitschrift für Operations Research Methods and Models of Operations Research | 1992-09-26 | Paper |
Mean-variance approach to the management of cyclic deliveries
Computers & Operations Research | 1988-01-01 | Paper |
