| Publication | Date of Publication | Type |
|---|
| Signed double Roman domination on cubic graphs | 2024-04-18 | Paper |
| A multilevel optimization approach for large scale battery exchange station location planning | 2024-01-12 | Paper |
| A policy-based learning beam search for combinatorial optimization | 2024-01-12 | Paper |
| Particle therapy patient scheduling with limited starting time variations of daily treatments | 2023-11-16 | Paper |
| An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem | 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 | 2021-11-08 | Paper |
| \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem | 2021-05-21 | Paper |
| An \(A^\ast\) search algorithm for the constrained longest common subsequence problem | 2021-02-04 | Paper |
| A model for finding transition-minors | 2020-06-29 | Paper |
| A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three | 2020-05-14 | Paper |
| Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm | 2020-01-20 | Paper |
| Anytime algorithms for the longest common palindromic subsequence problem | 2019-11-19 | Paper |
| A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands | 2019-09-16 | Paper |
| Solving a selective dial-a-ride problem with logic-based Benders decomposition | 2018-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4569439 | 2018-06-28 | Paper |
| Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition | 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 | 2017-12-01 | Paper |
| A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem | 2017-12-01 | Paper |
| A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem | 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 | 2016-10-06 | Paper |
| Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search | 2016-07-29 | 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 |
| Metaheuristics for solving a multimodal home-healthcare scheduling problem | 2016-06-30 | Paper |
| Models and algorithms for competitive facility location problems with different customer behavior | 2016-05-04 | Paper |
| Computational performance evaluation of two integer linear programming models for the minimum common string partition problem | 2016-02-23 | Paper |
| PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems | 2015-10-28 | Paper |
| Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization | 2015-10-09 | Paper |
| Stabilizing branch‐and‐price for constrained tree problems | 2013-08-06 | Paper |
| On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem | 2012-11-02 | Paper |
| A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem | 2012-10-18 | Paper |
| The Multidimensional Knapsack Problem: Structure and Algorithms | 2012-07-28 | Paper |
| Strong Lower Bounds for a Survivable Network Design Problem | 2012-05-13 | Paper |
| Solving the minimum label spanning tree problem by mathematical programming techniques | 2012-03-08 | Paper |
| Branch-and-cut-and-price for capacitated connected facility location | 2012-02-21 | Paper |
| Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints | 2011-09-09 | Paper |
| Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem | 2011-09-09 | Paper |
| A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems | 2011-06-24 | Paper |
| A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks | 2011-04-07 | Paper |
| Hybrid Metaheuristics | 2010-12-22 | Paper |
| The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search | 2010-11-24 | Paper |
| Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates | 2010-02-01 | Paper |
| A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem | 2009-05-07 | Paper |
| Evolutionary Computation in Combinatorial Optimization | 2009-05-05 | Paper |
| Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem | 2009-01-22 | Paper |
| Bringing order into the neighborhoods: Relaxation guided variable neighborhood search | 2008-11-17 | Paper |
| Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem | 2008-11-17 | Paper |
| An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem | 2008-07-10 | Paper |
| Models and algorithms for three-stage two-dimensional bin packing | 2007-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472033 | 2004-08-03 | Paper |
| Evolutionary local search for the edge-biconnectivity augmentation problem | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770481 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722077 | 2001-07-11 | Paper |
