| Publication | Date of Publication | Type |
|---|
| Hybrid variable neighborhood search for automated warehouse scheduling | 2023-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5878616 | 2023-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5878628 | 2023-02-21 | Paper |
| Optimization of the ambulance fleet location and relocation | 2022-08-29 | Paper |
| A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war | 2022-06-29 | Paper |
| The competitive hub location under the price war | 2020-05-19 | Paper |
| A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage | 2019-12-02 | Paper |
| The Branch and Cut Method for the Clique Partitioning Problem | 2019-12-02 | Paper |
| A Leader-Follower Hub Location Problem Under Fixed Markups | 2018-02-13 | Paper |
| The Existence of Equilibria in the Leader-Follower Hub Location and Pricing Problem | 2017-12-01 | Paper |
| A matheuristic for the discrete bilevel problem with multiple objectives at the lower level | 2017-10-02 | Paper |
| Genetic local search and hardness of approximation for the server load balancing problem | 2017-08-23 | Paper |
| Comparison of metaheuristics for the bilevel facility location and mill pricing problem | 2016-08-12 | Paper |
| A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem | 2016-08-12 | Paper |
| A hybrid VND method for the split delivery vehicle routing problem | 2016-07-29 | Paper |
| An exact method for the discrete \((r|p)\)-centroid problem | 2015-10-28 | Paper |
| Local search with an exponential neighborhood for the servers load balancing problem | 2015-07-27 | Paper |
| The variable neighborhood search for the two machine flow shop problem with a passive prefetch | 2015-07-17 | Paper |
| Competitive location in cognitive radio networks | 2015-04-29 | Paper |
| A new alternating heuristic for the (r | p)–centroid problem on the plane | 2015-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928708 | 2014-11-10 | Paper |
| Fast metaheuristics for the discrete \((r|p)\)-centroid problem | 2014-10-16 | Paper |
| On the complexity of the \((r|p)\)-centroid problem in the plane | 2014-09-26 | Paper |
| A double VNS heuristic for the facility location and pricing problem | 2013-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4928163 | 2013-06-10 | Paper |
| Large neighborhood local search for the p-median problem | 2013-06-10 | Paper |
| Genetic local search the graph partitioning problem under cardinality constraints | 2012-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115571 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115577 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115656 | 2012-02-10 | Paper |
| New lower bounds for the facility location problem with clients’ preferences | 2009-12-17 | Paper |
| Formulation space search approach for the teacher/class timetabling problem | 2009-12-03 | Paper |
| Computational bounds for local search in combinatorial optimization | 2008-12-09 | Paper |
| Complexity of local search for the \(p\)-median problem | 2008-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451582 | 2004-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434988 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429359 | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429362 | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789856 | 2003-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712334 | 2001-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936549 | 2000-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233340 | 1999-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233326 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866346 | 1997-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888943 | 1996-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3364385 | 1995-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735465 | 1984-01-01 | Paper |
