| Publication | Date of Publication | Type |
|---|
On the computational complexity of the strong geodetic recognition problem
RAIRO. Operations Research | 2025-01-08 | Paper |
Combinatorial models for scheduling sports tournaments
EURO Advanced Tutorials on Operational Research | 2024-09-12 | Paper |
The nilcatenation problem and its application for detecting money laundering activities in cryptocurrency networks
International Transactions in Operational Research | 2024-06-25 | Paper |
Polynomial time algorithms for the token swapping problem on cographs
RAIRO - Operations Research | 2024-04-14 | Paper |
Branch‐and‐cut algorithms for the ‐arborescence star problem
International Transactions in Operational Research | 2023-11-27 | Paper |
Gamma deployment problem in grids: hardness and new integer linear programming formulation
International Transactions in Operational Research | 2023-11-17 | Paper |
A tutorial on graph models for scheduling round‐robin sports tournaments
International Transactions in Operational Research | 2023-10-04 | Paper |
Maritime inventory routing: recent trends and future directions
International Transactions in Operational Research | 2023-10-04 | Paper |
On the arboreal jump number of a poset
| 2022-09-02 | Paper |
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
European Journal of Operational Research | 2022-03-11 | Paper |
Recoloring subgraphs of \(K_{2n}\) for sports scheduling
Theoretical Computer Science | 2021-06-23 | Paper |
Load-dependent speed optimization in maritime inventory routing
Computers & Operations Research | 2021-04-20 | Paper |
Organising metabolic networks: cycles in flux distributions
Journal of Theoretical Biology | 2019-02-12 | Paper |
One-sided weak dominance drawing
Theoretical Computer Science | 2019-01-18 | Paper |
The matching relaxation for a class of generalized set partitioning problems
Discrete Applied Mathematics | 2018-12-18 | Paper |
A new neighborhood structure for round robin scheduling problems
Computers & Operations Research | 2018-07-12 | Paper |
What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
European Journal of Operational Research | 2018-07-12 | Paper |
Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
Computers & Operations Research | 2018-07-11 | Paper |
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments
International Transactions in Operational Research | 2018-01-12 | Paper |
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
International Transactions in Operational Research | 2017-03-16 | Paper |
Combinatorial relaxation bounds and preprocessing for berth allocation problems
| 2017-02-14 | Paper |
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
Computational Optimization and Applications | 2016-12-15 | Paper |
Sports scheduling search space connectivity: a riffle shuffle driven approach
Discrete Applied Mathematics | 2016-11-02 | Paper |
Edge coloring: a natural model for sports scheduling
European Journal of Operational Research | 2016-10-07 | Paper |
Erratum to: ``Characterizing acyclic graphs by labeling edges
Discrete Applied Mathematics | 2015-04-28 | Paper |
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
International Transactions in Operational Research | 2015-04-22 | Paper |
A branch and cut algorithm for minimum spanning trees under conflict constraints
Optimization Letters | 2015-02-23 | Paper |
On the maximum acyclic subgraph problem under disjunctive constraints
Information Processing Letters | 2014-12-09 | Paper |
Characterizing acyclic graphs by labeling edges
Discrete Applied Mathematics | 2014-05-05 | Paper |
A new formulation for spanning trees
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
An ILS heuristic for the traveling tournament problem with predefined venues
Annals of Operations Research | 2012-11-15 | Paper |
A general VNS heuristic for the traveling salesman problem with time windows
Discrete Optimization | 2012-06-20 | Paper |
Discrete optimization methods to determine trajectories for Dubins' vehicles
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
The traveling tournament problem with predefined venues
Journal of Scheduling | 2010-03-08 | Paper |
Scheduling in sports: an annotated bibliography
Computers & Operations Research | 2009-10-16 | Paper |
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
European Journal of Operational Research | 2008-07-10 | Paper |
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
European Journal of Operational Research | 2008-07-10 | Paper |
Exploring grid implementations of parallel cooperative metaheuristics
| 2008-06-03 | Paper |
Heuristics for the mirrored traveling tournament problem
European Journal of Operational Research | 2007-02-12 | Paper |
An application of integer programming to playoff elimination in football championships
International Transactions in Operational Research | 2006-11-22 | Paper |
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
Discrete Applied Mathematics | 2006-08-17 | Paper |
scientific article; zbMATH DE number 2230230 (Why is no real title available?)
| 2005-11-18 | Paper |
