| Publication | Date of Publication | Type |
|---|
| New formulations for two location problems with interconnected facilities | 2024-04-16 | Paper |
| Two extended formulations for the virtual network function placement and routing problem | 2023-12-18 | Paper |
| Solving Steiner trees: Recent advances, challenges, and perspectives | 2023-12-11 | Paper |
| Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem | 2023-12-02 | Paper |
| A survey on bilevel optimization under uncertainty | 2023-09-15 | Paper |
| A survey on mixed-integer programming techniques in bilevel optimization | 2023-07-12 | Paper |
| Mathematical programming formulations for the collapsed k-core problem | 2023-07-11 | Paper |
| An exact method for binary fortification games | 2023-07-10 | Paper |
| A bilevel approach for compensation and routing decisions in last-mile delivery | 2023-04-18 | Paper |
| A Brief Introduction to Robust Bilevel Optimization | 2022-11-29 | Paper |
| Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems | 2022-11-14 | Paper |
| Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem | 2022-09-19 | Paper |
| Comparison of formulations for the inventory routing problem | 2022-08-03 | Paper |
| Benders decomposition for a node-capacitated virtual network function placement and routing problem | 2022-03-07 | Paper |
| Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs | 2022-03-01 | Paper |
| A tailored Benders decomposition approach for last-mile delivery with autonomous robots | 2022-02-23 | Paper |
| A branch-and-cut algorithm for the edge interdiction clique problem | 2021-06-08 | Paper |
| An exact method for assortment optimization under the nested logit model | 2021-06-07 | Paper |
| The generalized reserve set covering problem with connectivity and buffer requirements | 2021-06-03 | Paper |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems | 2020-12-03 | Paper |
| Exact Approaches for Network Design Problems with Relays | 2020-12-02 | Paper |
| A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems | 2020-11-09 | Paper |
| A polyhedral study of the diameter constrained minimum spanning tree problem | 2020-08-31 | Paper |
| On integer and bilevel formulations for the \(k\)-vertex cut problem | 2020-08-27 | Paper |
| The incremental connected facility location problem | 2019-10-18 | Paper |
| Obtaining Optimalk-Cardinality Trees Fast | 2019-09-11 | Paper |
| A new branch-and-bound algorithm for the maximum edge-weighted clique problem | 2019-06-25 | Paper |
| The maximum clique interdiction problem | 2019-03-28 | Paper |
| Benders decomposition for very large scale partial set covering and maximal covering location problems | 2019-02-11 | Paper |
| On the use of intersection cuts for bilevel optimization | 2018-10-26 | Paper |
| A node‐based ILP formulation for the node‐weighted dominating Steiner problem | 2018-06-13 | Paper |
| Outer approximation and submodular cuts for maximum capture facility location problems with random utilities | 2018-05-30 | Paper |
| An algorithmic framework for the exact solution of tree-star problems | 2018-05-29 | Paper |
| Solving minimum-cost shared arborescence problems | 2018-05-25 | Paper |
| Stochastic survivable network design problems: theory and practice | 2018-05-24 | Paper |
| Decomposition methods for the two-stage stochastic Steiner tree problem | 2018-04-20 | Paper |
| Thinning out Steiner trees: a node-based model for uniform edge costs | 2018-02-23 | Paper |
| A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints | 2018-02-01 | Paper |
| A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs | 2018-01-11 | Paper |
| The connected facility location polytope | 2017-12-20 | Paper |
| An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem | 2017-12-06 | Paper |
| ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design | 2016-11-17 | Paper |
| Benders decomposition without separability: a computational study for capacitated facility location problems | 2016-10-07 | Paper |
| Intersection Cuts for Bilevel Optimization | 2016-08-10 | Paper |
| ILP and CP Formulations for the Lazy Bureaucrat Problem | 2016-07-25 | Paper |
| Hop constrained Steiner trees with multiple root nodes | 2016-06-23 | Paper |
| The Generalized Regenerator Location Problem | 2016-01-25 | Paper |
| On the Asymmetric Connected Facility Location Polytope | 2015-10-16 | Paper |
| The Recoverable Robust Two-Level Network Design Problem | 2015-09-11 | Paper |
| A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem | 2015-09-11 | Paper |
| Exact approaches for solving robust prize-collecting Steiner tree problems | 2015-07-28 | Paper |
| The Maximum Weight Connected Subgraph Problem | 2015-07-22 | Paper |
| The two-level diameter constrained spanning tree problem | 2015-04-16 | Paper |
| A MIP-based approach to solve the prize-collecting local access network design problem | 2015-02-19 | Paper |
| Lagrangian decompositions for the two-level FTTx network design problem | 2014-09-30 | Paper |
| Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities | 2014-07-27 | Paper |
| Obtaining optimal k -cardinality trees fast | 2014-04-01 | Paper |
| A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems | 2014-03-24 | Paper |
| A cutting plane algorithm for the capacitated connected facility location problem | 2013-08-08 | Paper |
| Variable Neighborhood Search for Solving the Balanced Location Problem | 2013-07-23 | Paper |
| The Rooted Maximum Node-Weight Connected Subgraph Problem | 2013-06-04 | Paper |
| On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes | 2012-11-02 | Paper |
| Exact approaches to the single-source network loading problem | 2012-06-18 | Paper |
| Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs | 2012-05-13 | Paper |
| A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes | 2011-09-09 | Paper |
| The Two Level Network Design Problem with Secondary Hop Constraints | 2011-09-09 | Paper |
| A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem | 2011-09-09 | Paper |
| MIP Modeling of Incremental Connected Facility Location | 2011-09-09 | Paper |
| Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut | 2010-12-09 | Paper |
| The regenerator location problem | 2010-11-24 | Paper |
| A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation | 2010-11-24 | Paper |
| MIP models for connected facility location: a theoretical and computational study | 2010-10-15 | Paper |
| Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice | 2010-09-16 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Strong Formulations for 2-Node-Connected Steiner Network Problems | 2009-01-27 | Paper |
| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472033 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418387 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153223 | 2002-11-05 | Paper |
| Solving the simple plant location problem by genetic algorithm | 2002-10-17 | Paper |
| Evolutionary local search for the edge-biconnectivity augmentation problem | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770481 | 2002-02-13 | Paper |
