| Publication | Date of Publication | Type |
|---|
Machine learning constructives and local searches for the travelling salesman problem
| 2024-09-17 | Paper |
The picking and packing problem in buy-online-pick-up-in-store retailing
| 2024-09-17 | Paper |
The missing Moore graph as an optimization problem
EURO Journal on Computational Optimization | 2024-04-24 | Paper |
Maximum independent sets and supervised learning
Journal of the Operations Research Society of China | 2024-02-09 | Paper |
Modeling the flying sidekick traveling salesman problem with multiple drones
Networks | 2023-12-11 | Paper |
Exact models for the flying sidekick traveling salesman problem
International Transactions in Operational Research | 2023-11-27 | Paper |
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
Parallel drone scheduling vehicle routing problems with collective drones
| 2023-07-07 | Paper |
Constraint Programming models for the parallel drone scheduling vehicle routing problem
| 2023-07-06 | Paper |
Precedence-constrained arborescences
European Journal of Operational Research | 2023-07-04 | Paper |
A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
Computers & Operations Research | 2023-07-04 | Paper |
An Ant Colony System for the Team Orienteering Problem with Time Windows
| 2023-05-12 | Paper |
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Annals of Operations Research | 2022-07-26 | Paper |
The maximum clique problem for permutation Hamming graphs
Journal of Optimization Theory and Applications | 2022-07-18 | Paper |
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
Optimization Letters | 2021-07-08 | Paper |
A tabu search algorithm for the probabilistic orienteering problem
Computers & Operations Research | 2021-05-21 | Paper |
Models and algorithms for the Flying Sidekick Traveling Salesman Problem
| 2019-10-04 | Paper |
A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
Computers & Operations Research | 2018-07-12 | Paper |
A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
Operations Research Proceedings | 2017-12-01 | Paper |
Heuristic Algorithms for Constructing Binary Constant Weight Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
| 2017-08-04 | Paper |
Mathematical programming models for home healthcare service optimisation
International Journal of Operational Research | 2017-05-31 | Paper |
scientific article; zbMATH DE number 6676558 (Why is no real title available?)
| 2017-01-20 | Paper |
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
Computers & Operations Research | 2016-11-10 | Paper |
Sampling-based objective function evaluation techniques for the orienteering problem with stochastic travel and service times
Operations Research Proceedings | 2016-05-19 | Paper |
scientific article; zbMATH DE number 6545534 (Why is no real title available?)
| 2016-02-25 | Paper |
An enhanced Ant Colony System for the Sequential Ordering Problem
Operations Research Proceedings | 2015-03-03 | Paper |
Wireless multicasting under probabilistic node failures: a heuristic approach
Optimization and Engineering | 2014-08-20 | Paper |
Permutation codes with specified packing radius
Designs, Codes and Cryptography | 2013-07-26 | Paper |
Some constant weight codes from primitive permutation groups
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks
Mathematical Methods of Operations Research | 2013-02-20 | Paper |
Coupling ant colony systems with strong local searches
European Journal of Operational Research | 2012-12-29 | Paper |
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Some valid inequalities for the probabilistic minimum power multicasting problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A new table of permutation codes
Designs, Codes and Cryptography | 2012-03-23 | Paper |
A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks
JMMA. Journal of Mathematical Modelling and Algorithms | 2012-02-21 | Paper |
Minimum power multicasting in wireless networks under probabilistic node failures
Computational Optimization and Applications | 2011-06-03 | Paper |
Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
Discrete Mathematics | 2011-05-31 | Paper |
A hybrid particle swarm optimization approach for the sequential ordering problem
Computers & Operations Research | 2011-01-31 | Paper |
Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
JMMA. Journal of Mathematical Modelling and Algorithms | 2009-11-25 | Paper |
Heuristic manipulation, tabu search and frequency assignment
Computers & Operations Research | 2009-11-17 | Paper |
A heuristic manipulation technique for the sequential ordering problem
Computers & Operations Research | 2008-05-23 | Paper |
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
European Journal of Operational Research | 2008-05-08 | Paper |
Time dependent vehicle routing problem with a multi ant colony system
European Journal of Operational Research | 2007-12-10 | Paper |
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
JMMA. Journal of Mathematical Modelling and Algorithms | 2007-08-27 | Paper |
The robust shortest path problem with interval data via Benders decomposition
4OR | 2006-10-11 | Paper |
A Benders decomposition approach for the robust spanning tree problem with interval data
European Journal of Operational Research | 2006-09-14 | Paper |
Ant colony system for a dynamic vehicle routing problem
Journal of Combinatorial Optimization | 2006-01-13 | Paper |
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
Computers & Operations Research | 2005-06-27 | Paper |
A branch and bound algorithm for the robust spanning tree problem with interval data
European Journal of Operational Research | 2005-02-09 | Paper |
An exact algorithm for the robust shortest path problem with interval data
Computers & Operations Research | 2004-11-12 | Paper |
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
European Journal of Operational Research | 2004-08-19 | Paper |
A branch and bound algorithm for the robust shortest path problem with interval data.
Operations Research Letters | 2004-03-15 | Paper |
Upper and lower bounds for the fixed spectrum frequency assignment problem. (Abstract of thesis)
4OR | 2003-01-01 | Paper |
Lower bounds for fixed spectrum frequency assignment
Annals of Operations Research | 2002-06-09 | Paper |
