| Publication | Date of Publication | Type |
|---|
| A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem | 2024-11-12 | Paper |
Scheduling jobs using queries to interactively learn human availability times
Computers & Operations Research | 2024-07-08 | Paper |
Signed double Roman domination on cubic graphs
Applied Mathematics and Computation | 2024-04-18 | Paper |
A multilevel optimization approach for large scale battery exchange station location planning
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
A policy-based learning beam search for combinatorial optimization
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
International Transactions in Operational Research | 2023-11-16 | Paper |
Particle therapy patient scheduling with limited starting time variations of daily treatments
International Transactions in Operational Research | 2023-11-16 | Paper |
| On solving a generalized constrained longest common subsequence problem | 2023-01-25 | Paper |
| On the use of decision diagrams for finding repetition-free longest common subsequences | 2023-01-25 | Paper |
| Distributing battery swapping stations for electric scooters in an urban area | 2023-01-25 | Paper |
| A learning large neighborhood search for the staff rerostering problem | 2022-08-30 | Paper |
| A beam search for the shortest common supersequence problem guided by an approximate expected length calculation | 2022-08-11 | Paper |
| A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem | 2022-03-21 | Paper |
| Learning surrogate functions for the short-horizon planning in same-day delivery problems | 2022-03-21 | Paper |
| A beam search approach to the traveling tournament problem | 2021-12-08 | Paper |
\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
Annals of Operations Research | 2021-11-08 | Paper |
\(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
Computers & Operations Research | 2021-05-21 | Paper |
An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
Information Processing Letters | 2021-02-04 | Paper |
A model for finding transition-minors
Discrete Applied Mathematics | 2020-06-29 | Paper |
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
Applied Mathematics and Computation | 2020-05-14 | Paper |
Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
Artificial Intelligence | 2020-01-20 | Paper |
Anytime algorithms for the longest common palindromic subsequence problem
Computers & Operations Research | 2019-11-19 | Paper |
A variable neighborhood search for the generalized vehicle routing problem with stochastic demands
Evolutionary Computation in Combinatorial Optimization | 2019-09-16 | Paper |
Solving a selective dial-a-ride problem with logic-based Benders decomposition
Computers & Operations Research | 2018-07-11 | Paper |
| scientific article; zbMATH DE number 6897337 (Why is no real title available?) | 2018-06-28 | Paper |
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
Networks | 2018-04-27 | Paper |
| The core concept for the Multidimensional Knapsack problem | 2018-04-12 | Paper |
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
Operations Research Proceedings | 2017-12-01 | Paper |
A logic-based benders decomposition approach for the 3-staged strip packing problem
Operations Research Proceedings | 2017-12-01 | Paper |
A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
Journal of Heuristics | 2017-04-26 | Paper |
| A multi-commodity flow based model for multi layer hierarchical ring network design | 2016-10-18 | Paper |
| An integer L-shaped method for the generalized vehicle routing problem with stochastic demands | 2016-10-18 | Paper |
Decomposition based hybrid metaheuristics
European Journal of Operational Research | 2016-10-06 | Paper |
| Variable neighborhood search for integrated timetable based design of railway infrastructure | 2016-07-29 | Paper |
| Boosting an exact logic-based Benders decomposition approach by variable neighborhood search | 2016-07-29 | Paper |
| Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search | 2016-07-29 | Paper |
Metaheuristics for solving a multimodal home-healthcare scheduling problem
CEJOR. Central European Journal of Operations Research | 2016-06-30 | Paper |
Models and algorithms for competitive facility location problems with different customer behavior
Annals of Mathematics and Artificial Intelligence | 2016-05-04 | Paper |
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
Optimization Letters | 2016-02-23 | Paper |
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
Journal of Global Optimization | 2015-10-28 | Paper |
Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
Hybrid Metaheuristics | 2015-10-09 | Paper |
Stabilizing branch-and-price for constrained tree problems
Networks | 2013-08-06 | Paper |
On solving the rooted delay- and delay-variation-constrained Steiner tree problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
A variable neighborhood search approach for the two-echelon location-routing problem
Evolutionary Computation in Combinatorial Optimization | 2012-10-18 | Paper |
The multidimensional knapsack problem: structure and algorithms
INFORMS Journal on Computing | 2012-07-28 | Paper |
Strong lower bounds for a survivable network design problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Solving the minimum label spanning tree problem by mathematical programming techniques
Advances in Operations Research | 2012-03-08 | Paper |
Branch-and-cut-and-price for capacitated connected facility location
JMMA. Journal of Mathematical Modelling and Algorithms | 2012-02-21 | Paper |
Introducing the virtual network mapping problem with delay, routing and location constraints
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
Operations Research Proceedings | 2011-04-07 | Paper |
Hybrid metaheuristics
Hybrid Optimization | 2010-12-22 | Paper |
The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
Networks | 2010-11-24 | Paper |
Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
JMMA. Journal of Mathematical Modelling and Algorithms | 2010-02-01 | Paper |
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Recent Advances in Evolutionary Computation for Combinatorial Optimization | 2009-05-07 | Paper |
Evolutionary Computation in Combinatorial Optimization
Lecture Notes in Computer Science | 2009-05-05 | Paper |
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
AIP Conference Proceedings | 2009-01-22 | Paper |
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
Journal of Heuristics | 2008-11-17 | Paper |
Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
Journal of Heuristics | 2008-11-17 | Paper |
An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
European Journal of Operational Research | 2008-07-10 | Paper |
Models and algorithms for three-stage two-dimensional bin packing
European Journal of Operational Research | 2007-08-27 | Paper |
| scientific article; zbMATH DE number 2079893 (Why is no real title available?) | 2004-08-03 | Paper |
Evolutionary local search for the edge-biconnectivity augmentation problem
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1703848 (Why is no real title available?) | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1617338 (Why is no real title available?) | 2001-07-11 | Paper |
