| Publication | Date of Publication | Type |
|---|
| Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks | 2023-12-11 | Paper |
| Computational comparisons of different formulations for the Stackelberg minimum spanning tree game | 2023-11-21 | Paper |
| A survey on mixed-integer programming techniques in bilevel optimization | 2023-07-12 | Paper |
| Dendrograms, minimum spanning trees and feature selection | 2023-07-10 | Paper |
| Product line optimization with multiples sites | 2022-09-27 | Paper |
| A bilevel optimization approach to decide the feasibility of bookings in the European gas market | 2022-07-15 | Paper |
| The geodesic classification problem on graphs | 2022-04-27 | Paper |
| Multi-market portfolio optimization with conditional value at risk | 2022-03-11 | Paper |
| Benders decomposition for network design covering problems | 2022-03-09 | Paper |
| Mixed-integer formulations for the capacitated rank pricing problem with envy | 2022-03-09 | Paper |
| The rank pricing problem with ties | 2021-11-05 | Paper |
| Shortest paths and location problems in a continuous framework with different $\ell_p$-norms on different regions | 2021-10-15 | Paper |
| Closing the gap in linear bilevel optimization: a new valid primal-dual inequality | 2021-07-08 | Paper |
| Coordinating resources in Stackelberg security games | 2021-06-07 | Paper |
| Finding the root graph through minimum edge deletion | 2021-06-03 | Paper |
| Models and algorithms for the product pricing with single-minded customers requesting bundles | 2021-05-21 | Paper |
| Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization | 2021-01-19 | Paper |
| A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem | 2021-01-07 | Paper |
| An exact dynamic programming approach to segmented isotonic regression | 2020-12-07 | Paper |
| Discussion of Fairness and Implementability in Stackelberg Security Games | 2020-07-20 | Paper |
| Benders decomposition for Network Design Covering Problems | 2020-07-13 | Paper |
| Bookings in the European gas market: characterisation of feasibility and computational complexity results | 2020-03-04 | Paper |
| A study of general and security Stackelberg game formulations | 2019-06-27 | Paper |
| A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph | 2019-05-17 | Paper |
| Mixed integer linear programming for feature selection in support vector machine | 2019-05-17 | Paper |
| New models for the location of controversial facilities: a bilevel programming approach | 2019-04-18 | Paper |
| The rank pricing problem: models and branch-and-cut algorithms | 2019-02-19 | Paper |
| A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem | 2018-07-11 | Paper |
| Lagrangian relaxation for SVM feature selection | 2018-07-11 | Paper |
| Network pricing problem with unit toll | 2018-06-13 | Paper |
| Lexicographical order in integer programming | 2017-09-25 | Paper |
| Improved integer linear programming formulations for the job sequencing and tool switching problem | 2016-10-06 | Paper |
| A branch-cut-and-price algorithm for the piecewise linear transportation problem | 2016-10-06 | Paper |
| Bilevel programming and price setting problems | 2016-07-22 | Paper |
| The Balanced Minimum Evolution Problem | 2016-06-29 | Paper |
| Identification of all steady states in large networks by logical analysis | 2016-03-08 | Paper |
| Comments on: ``Static and dynamic source locations in undirected networks | 2015-11-06 | Paper |
| The balanced minimum evolution problem under uncertain data | 2014-04-22 | Paper |
| A branch‐and‐cut algorithm for the ring spur assignment problem | 2013-08-06 | Paper |
| Stochastic binary problems with simple penalties for capacity constraints violations | 2013-05-06 | Paper |
| Bilevel programming and price setting problems | 2013-03-25 | Paper |
| A Class Representative Model for Pure Parsimony Haplotyping | 2012-07-28 | Paper |
| Solving Large p-Median Problems with a Radius Formulation | 2012-07-28 | Paper |
| A New Formulation and Resolution Method for the p-Center Problem | 2012-06-08 | Paper |
| Valid inequalities and branch-and-cut for the clique pricing problem | 2012-03-07 | Paper |
| Scheduling two chains of unit jobs on one machine: A polyhedral study | 2011-11-21 | Paper |
| Generalized network design polyhedra | 2011-11-21 | Paper |
| Improved Formulations for the Ring Spur Assignment Problem | 2011-09-09 | Paper |
| An exact approach to the problem of extracting an embedded network matrix | 2011-04-28 | Paper |
| Reduction approaches for robust shortest path problems | 2011-04-28 | Paper |
| Bilevel Programming and Price Setting Problems | 2011-04-07 | Paper |
| A polyhedral study of the network pricing problem with connected toll arcs | 2010-11-24 | Paper |
| Size-constrained graph partitioning polytopes | 2010-11-19 | Paper |
| A branch-and-cut algorithm for the partitioning-hub location-routing problem | 2010-10-15 | Paper |
| Generating Facets for the Independence System Polytope | 2010-08-27 | Paper |
| The pure parsimony haplotyping problem: overview and computational advances | 2010-05-31 | Paper |
| PRICING GEOMETRIC TRANSPORTATION NETWORKS | 2010-02-12 | Paper |
| Joint Design and Pricing on a Network | 2009-08-13 | Paper |
| Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion | 2009-07-28 | Paper |
| Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results | 2009-05-07 | Paper |
| Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships | 2008-12-17 | Paper |
| New formulations and valid inequalities for a bilevel pricing problem | 2008-08-06 | Paper |
| Solving haplotyping inference parsimony problem using a new basic polynomial formulation | 2008-06-12 | Paper |
| A branch-and-cut method for the obnoxious \(p\)-median problem | 2008-05-20 | Paper |
| Optimization models for the single delay management problem in public transportation | 2008-04-24 | Paper |
| Solving the hub location problem in a star–star network | 2008-01-08 | Paper |
| A strengthened formulation for the simple plant location problem with order | 2007-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294055 | 2007-07-23 | Paper |
| The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut | 2007-02-02 | Paper |
| Polyhedral analysis for concentrator location problems | 2006-11-17 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| A branch and cut algorithm for hub location problems with single assignment | 2005-04-19 | Paper |
| A branch-and-cut algorithm for the plant-cycle location problem | 2005-04-04 | Paper |
| Adapting polyhedral properties from facility to hub location problems | 2005-01-31 | Paper |
| Projecting the flow variables for hub location problems | 2005-01-12 | Paper |
| Locating median cycles in networks | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4811395 | 2004-09-06 | Paper |
| The Ring Star Problem: Polyhedral analysis and exact algorithm | 2004-08-04 | Paper |
| The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm | 2004-03-15 | Paper |
| Two-connected networks with rings of bounded cardinality | 2004-03-15 | Paper |
| Covering a graph with cycles. | 2003-09-07 | Paper |
| Solving thep-Center problem with Tabu Search and Variable Neighborhood Search | 2003-08-20 | Paper |
| Upper bounds and algorithms for the maximum cardinality bin packing problem. | 2003-07-30 | Paper |
| Generalized network design problems. | 2003-06-09 | Paper |
| Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives | 2003-05-04 | Paper |
| Polyhedral results for two-connected networks with bounded rings | 2002-12-01 | Paper |
| A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem | 2002-09-02 | Paper |
| Finding Disjoint Routes in Telecommunications Networks with Two Technologies | 2002-08-15 | Paper |
| The Uncapacitated Facility Location Problem with Client Matching | 2002-06-04 | Paper |
| Solving the Two-Connected Network with Bounded Meshes Problem | 2002-06-04 | Paper |
| A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing | 2002-04-17 | Paper |
| A comparative analysis of several formulations for the generalized minimum spanning tree problem | 2002-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955272 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3147665 | 2002-01-01 | Paper |
| On generalized minimum spanning trees | 2001-10-14 | Paper |
| Locations on time-varying networks | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707233 | 2001-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762519 | 2001-02-22 | Paper |
| A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network | 2001-01-01 | Paper |
| Exact solution of the SONET ring loading problem | 2000-01-31 | Paper |
| Multicriteria network location problems with sum objectives | 1999-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4229633 | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398373 | 1998-07-19 | Paper |
| On the Two-Level Uncapacitated Facility Location Problem | 1997-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687198 | 1996-12-11 | Paper |
| Complexity of spanning tree problems with leaf-dependent objectives | 1996-08-05 | Paper |
| Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem | 1996-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867319 | 1996-02-28 | Paper |
| An exact algorithm for the dual bin packing problem | 1995-06-19 | Paper |
| Improved Algorithms for Machine Allocation in Manufacturing Systems | 1995-04-17 | Paper |
| The multi-level uncapacitated facility location problem is not submodular | 1994-07-26 | Paper |
| The multi-level uncapacitated facility location problem is not submodular | 1994-04-12 | Paper |
| A note on a stochastic location problem | 1994-02-17 | Paper |
| Two-dimensional rectangle packing: On-line methods and results | 1994-01-09 | Paper |
| Approximation algorithms for the capacitated plant allocation problem | 1994-01-01 | Paper |
| On locating path- or tree-shaped facilities on networks | 1993-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289275 | 1993-08-22 | Paper |
| The Voronoi Partition of a Network and Its Implications in Location Theory | 1993-02-25 | Paper |
| Sensitivity Analysis in Minisum Facility Location Problems | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3988807 | 1992-06-28 | Paper |
| Market and Locational Equilibrium for Two Competitors | 1992-06-28 | Paper |
| Capacitated Vehicle Routing on Trees | 1992-06-26 | Paper |
| From the median to the generalized center | 1992-06-25 | Paper |
| The continuous center set of a network | 1991-01-01 | Paper |
| Commuters' Paths with Penalties for Early or Late Arrival Time | 1990-01-01 | Paper |
| Location of an obnoxious facility on a network: A voting approach | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212291 | 1990-01-01 | Paper |
| Sensitivity analysis in multiple objective linear programming: The tolerance approach | 1989-01-01 | Paper |
| Competitive Location with Random Utilities | 1989-01-01 | Paper |
| A tree-network has the fixed point property | 1989-01-01 | Paper |
| The continuousp-median of a network | 1989-01-01 | Paper |
| Algorithms for Voting and Competitive Location on a Network | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030583 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3755206 | 1987-01-01 | Paper |
| How bad can a voting locating be | 1986-01-01 | Paper |
| Outcomes of voting and planning in single facility location problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696816 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3040895 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3955132 | 1982-01-01 | Paper |
