| Publication | Date of Publication | Type |
|---|
| On properties of \(h\)-differentiable functions | 2025-01-22 | Paper |
| On local invertibility of functions of an \(h\)-complex variable | 2025-01-22 | Paper |
| Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities | 2024-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6198621 | 2024-02-23 | Paper |
| MIP heuristics for a resource constrained project scheduling problem with workload stability constraints | 2023-08-21 | Paper |
| Discrete facility location in machine learning | 2022-08-29 | Paper |
| Near-optimal large-scale k-medoids clustering | 2021-11-30 | Paper |
| Integer programming approach to the data traffic paths recovering problem | 2021-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369713 | 2017-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5364361 | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5275490 | 2017-07-14 | Paper |
| A branch and cut heuristic for a runway scheduling problem | 2017-02-17 | Paper |
| Lifted and local reachability cuts for the vehicle routing problem with time windows | 2016-11-10 | Paper |
| An implementation of exact knapsack separation | 2016-10-26 | Paper |
| Computational testing of a separation procedure for the knapsack set with a single continuous variable | 2016-06-29 | Paper |
| The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming | 2016-06-10 | Paper |
| Threshold robustness in discrete facility location problems: a bi-objective approach | 2015-10-06 | Paper |
| A cutting plane method for knapsack polytope | 2013-08-05 | Paper |
| On an approach to the robustness in the case of the \(p\)-median problem | 2013-06-12 | Paper |
| Polyhedral study of simple plant location problem with order | 2013-05-14 | Paper |
| An aggregation heuristic for large scale p-median problem | 2012-11-15 | Paper |
| A computational study of a nonlinear minsum facility location problem | 2012-11-15 | Paper |
| Lagrangian relaxations for the nonlinear \(p\)-median problem | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115658 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115726 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161276 | 2010-10-14 | Paper |
| A computational study of exact knapsack separation for the generalized assignment problem | 2010-04-28 | Paper |
| New lower bounds for the facility location problem with clients' preferences | 2009-12-17 | Paper |
| An effective heuristic for large-scale capacitated facility location problems | 2009-12-11 | Paper |
| Computational experience with general cutting planes for the set covering problem | 2009-02-23 | Paper |
| A computational study of local search algorithms for Italian high-school timetabling | 2008-06-23 | Paper |
| A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes | 2008-04-11 | Paper |
| A computational study of a cutting plane algorithm for university course timetabling | 2007-05-15 | Paper |
| Computational study of large-scale \(p\)-median problems | 2007-03-05 | Paper |
| A branch-and-cut algorithm for the median-path problem | 2006-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708526 | 2005-11-18 | Paper |
| A decomposition approach for a very large scale optimal diversity management problem | 2005-08-25 | Paper |
| Using real space pseudopotentials for the electronic structure problem | 2005-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821193 | 2004-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510232 | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353365 | 1998-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5758639 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761081 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3345259 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940278 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957404 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898992 | 1981-01-01 | Paper |
