| Publication | Date of Publication | Type |
|---|
| A computational study on integer programming formulations for hop-constrained survivable network design | 2025-01-06 | Paper |
| A solution algorithm for chance-constrained problems with integer second-stage recourse decisions | 2024-04-09 | Paper |
| Adjustable Robust Optimization with Discrete Uncertainty | 2024-03-26 | Paper |
| In search of dense subgraphs: How good is greedy peeling? | 2023-12-11 | Paper |
| Adjustable robust optimization with objective uncertainty | 2023-11-14 | Paper |
| An exact method for binary fortification games | 2023-07-10 | Paper |
| Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case | 2023-07-04 | Paper |
| Network Design with Service Requirements: Scaling-up the Size of Solvable Problems | 2022-12-01 | Paper |
| \(K\)-adaptability in stochastic optimization | 2022-11-14 | Paper |
| Exact algorithms for the 0-1 time-bomb knapsack problem | 2022-06-22 | Paper |
| 2DPackLib: a two-dimensional cutting and packing library | 2022-03-15 | Paper |
| The assignment and loading transportation problem | 2021-06-03 | Paper |
| Exact solution techniques for two-dimensional cutting and packing | 2021-06-03 | Paper |
| Lower and upper bounds for the non-linear generalized assignment problem | 2021-04-20 | Paper |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems | 2020-12-03 | Paper |
| A branch-and-cut algorithm for mixed-integer bilinear programming | 2020-01-08 | Paper |
| Minimum tiling of a rectangle by squares | 2019-03-06 | Paper |
| Integer optimization with penalized fractional values: the knapsack case | 2018-12-06 | Paper |
| On the use of intersection cuts for bilevel optimization | 2018-10-26 | Paper |
| On the product knapsack problem | 2018-08-03 | Paper |
| Least cost influence propagation in (social) networks | 2018-07-13 | Paper |
| Exact approaches for the knapsack problem with setups | 2018-07-11 | Paper |
| SelfSplit parallelization for mixed-integer linear programming | 2018-07-11 | Paper |
| A dynamic reformulation heuristic for generalized interdiction problems | 2018-05-30 | Paper |
| Mixed-integer linear programming heuristics for the prepack optimization problem | 2018-05-24 | Paper |
| Thinning out Steiner trees: a node-based model for uniform edge costs | 2018-02-23 | Paper |
| Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling | 2018-02-06 | Paper |
| A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs | 2018-01-11 | Paper |
| Proximity search for 0--1 mixed-integer convex programming | 2017-04-26 | Paper |
| Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints | 2016-12-22 | Paper |
| On handling indicator constraints in mixed integer programming | 2016-12-15 | Paper |
| Models and algorithms for packing rectangles into the smallest square | 2016-11-17 | Paper |
| Exact solution of the robust knapsack problem | 2016-11-10 | Paper |
| Intersection Cuts for Bilevel Optimization | 2016-08-10 | Paper |
| Theoretical and computational results about optimality-based domain reductions | 2016-05-25 | Paper |
| Improving branch-and-cut performance by random sampling | 2016-04-13 | Paper |
| Exploiting Erraticism in Search | 2014-06-26 | Paper |
| On the Robust Knapsack Problem | 2014-04-09 | Paper |
| Cutting plane versus compact formulations for uncertain (integer) linear programs | 2013-08-05 | Paper |
| Three Ideas for the Quadratic Assignment Problem | 2012-12-07 | Paper |
| Complexity and approximation of an area packing problem | 2012-11-30 | Paper |
| Exact algorithms for the two-dimensional guillotine knapsack | 2012-11-15 | Paper |
| Branching on nonchimerical fractionalities | 2012-08-17 | Paper |
| A metaheuristic approach for the vertex coloring problem | 2012-07-28 | Paper |
| Heuristic and exact algorithms for the identical parallel machine scheduling problem | 2012-07-28 | Paper |
| An exact approach for the vertex coloring problem | 2012-06-20 | Paper |
| An approximation scheme for the two-stage, two-dimensional knapsack problem | 2012-06-20 | Paper |
| A set-covering-based heuristic approach for bin-packing problems | 2012-06-18 | Paper |
| An exact approach to the strip-packing problem | 2012-05-30 | Paper |
| Backdoor branching | 2011-06-24 | Paper |
| Two-dimensional bin packing problems | 2010-12-08 | Paper |
| Light robustness | 2009-12-03 | Paper |
| Models and heuristic algorithms for a weighted vertex coloring problem | 2009-11-20 | Paper |
| An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem | 2009-06-18 | Paper |
| Bidimensional packing by bilinear programming | 2009-05-04 | Paper |
| How tight is the corner relaxation? | 2008-10-29 | Paper |
| Bidimensional Packing by Bilinear Programming | 2007-08-30 | Paper |
| Packing into the smallest square: worst-case analysis of lower bounds | 2007-02-20 | Paper |
| A Lagrangian heuristic algorithm for a real-world train timetabling problem | 2006-04-28 | Paper |
| Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem | 2006-03-22 | Paper |
| Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737536 | 2004-08-11 | Paper |
| On the two-dimensional knapsack problem | 2004-07-01 | Paper |
| Algorithms for packing and scheduling problems. (Abstract of thesis) | 2004-05-18 | Paper |
| Models and algorithms for a staff scheduling problem | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452972 | 2004-03-07 | Paper |
| Integer linear programming models for 2-staged two-dimensional knapsack problems | 2003-10-29 | Paper |
| Two-dimensional packing problems: a survey | 2002-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2759903 | 2001-12-18 | Paper |
