| Publication | Date of Publication | Type |
|---|
Locality sensitive algotrithms for data mule routing problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
A two-phase multi-objective metaheuristic for a green UAV grid routing problem
Optimization Letters | 2023-11-07 | Paper |
On conflict-free spanning tree: algorithms and complexity
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
| Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case | 2022-07-01 | Paper |
| Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes | 2022-06-29 | Paper |
UAVs routes optimization on smart cities and regions
RAIRO - Operations Research | 2022-05-09 | Paper |
A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Computers & Operations Research | 2022-03-07 | Paper |
Finding the maximum multi improvement on neighborhood exploration
Optimization Letters | 2022-01-21 | Paper |
An ILS-based heuristic applied to the car renter salesman problem
RAIRO - Operations Research | 2021-07-27 | Paper |
The biclique partitioning polytope
Discrete Applied Mathematics | 2021-06-14 | Paper |
Efficient approaches for the flooding problem on graphs
Annals of Operations Research | 2020-05-11 | Paper |
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization | 2019-10-18 | Paper |
A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
Annals of Operations Research | 2019-03-06 | Paper |
A hybrid metaheuristic for the minimum labeling spanning tree problem
European Journal of Operational Research | 2019-01-09 | Paper |
| Efficient heuristics for the minimum labeling global cut problem | 2018-10-11 | Paper |
| General variable neighborhood search for the data mule scheduling problem | 2018-10-11 | Paper |
A multi-objective green UAV routing problem
Computers & Operations Research | 2018-07-12 | Paper |
A matheuristic for the cell formation problem
Optimization Letters | 2018-04-19 | Paper |
| A performance study on multi improvement neighborhood search strategy | 2018-01-04 | Paper |
New heuristics for the bicluster editing problem
Annals of Operations Research | 2017-12-15 | Paper |
A hybrid algorithm for a class of vehicle routing problems
Computers & Operations Research | 2016-11-10 | Paper |
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
Computers & Operations Research | 2016-11-10 | Paper |
An iterated local search heuristic for the split delivery vehicle routing problem
Computers & Operations Research | 2016-11-10 | Paper |
| A hybrid heuristic based on iterated local search for multivehicle inventory routing problem | 2016-10-18 | Paper |
On solving manufacturing cell formation via bicluster editing
European Journal of Operational Research | 2016-10-07 | Paper |
A parallel hybrid metaheuristic for bicluster editing
International Transactions in Operational Research | 2016-06-09 | Paper |
Efficient algorithms for cluster editing
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
A new hybrid heuristic for replica placement and request distribution in content distribution networks
Optimization Letters | 2015-04-23 | Paper |
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
Optimization Letters | 2013-11-01 | Paper |
Hybrid metaheuristic for bicluster editing problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A hybrid algorithm for the heterogeneous fleet vehicle routing problem
European Journal of Operational Research | 2012-12-29 | Paper |
A simple and effective metaheuristic for the minimum latency problem
European Journal of Operational Research | 2012-12-29 | Paper |
Strong bounds with cut and column generation for class-teacher timetabling
Annals of Operations Research | 2012-11-15 | Paper |
The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
Computers & Operations Research | 2012-11-15 | Paper |
Solving replica placement and request distribution in content distribution networks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Operations Research Letters | 2012-04-05 | Paper |
Effective heuristics for the set covering with pairs problem
International Transactions in Operational Research | 2011-05-20 | Paper |
An iterative local search approach applied to the optimal stratification problem
International Transactions in Operational Research | 2011-05-20 | Paper |
A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem
TEMA - Tendências em Matemática Aplicada e Computacional | 2011-04-04 | Paper |
| scientific article; zbMATH DE number 5874210 (Why is no real title available?) | 2011-04-04 | Paper |
Near-optimal solutions for the generalized max-controlled set problem
Computers & Operations Research | 2010-06-11 | Paper |
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
Computers & Operations Research | 2010-06-11 | Paper |
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
The Generalized Max-Controlled Set Problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
An asynchronous parallel metaheuristic for the period vehicle routing problem
Future Generation Computer Systems | 2002-07-14 | Paper |
| Reduction rules for the covering tour problem | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 3791541 (Why is no real title available?) | 1982-01-01 | Paper |
