| Publication | Date of Publication | Type |
|---|
| Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods | 2023-11-21 | Paper |
| On some algorithmic aspects of hypergraphic matroids | 2022-11-23 | Paper |
| Network disconnection games: a game theoretic approach to checkpoint evaluation in networks | 2022-01-05 | Paper |
| Training Neural Networks with an algorithm for piecewise linear functions | 2021-05-13 | Paper |
| On the \(p\)-median polytope and the directed odd cycle inequalities | 2021-02-04 | Paper |
| Network strength games: the core and the nucleolus | 2020-02-20 | Paper |
| On dual integrality in matching problems | 2019-07-22 | Paper |
| An algorithm to compute the nucleolus of shortest path games | 2019-06-27 | Paper |
| Faster algorithms for security games on matroids | 2019-03-11 | Paper |
| Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem | 2018-10-26 | Paper |
| On a connection between facility location and perfect graphs | 2018-09-28 | Paper |
| On the p‐median polytope and the odd directed cycle inequalities: Oriented graphs | 2018-09-04 | Paper |
| On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs | 2018-05-24 | Paper |
| On the nucleolus of shortest path games | 2018-02-13 | Paper |
| On the Location and p-Median Polytopes | 2017-04-07 | Paper |
| Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem | 2016-08-10 | Paper |
| Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs | 2016-06-23 | Paper |
| Stackelberg bipartite vertex cover and the preflow algorithm | 2016-04-06 | Paper |
| The Dominating Set Polytope via Facility Location | 2015-10-16 | Paper |
| Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs | 2014-06-02 | Paper |
| A polyhedral study of a two level facility location model | 2014-05-26 | Paper |
| On the linear relaxation of the \(p\)-median problem | 2012-06-20 | Paper |
| On the p-median polytope of fork-free graphs | 2012-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109933 | 2012-01-26 | Paper |
| On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms | 2011-10-27 | Paper |
| On the Integrality of Some Facility Location Polytopes | 2010-06-01 | Paper |
| Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches | 2009-07-18 | Paper |
| A linear programming approach to increasing the weight of all minimum spanning trees | 2008-12-17 | Paper |
| On the \(p\)-median polytope of \(Y\)-free graphs | 2008-10-29 | Paper |
| Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut | 2007-04-05 | Paper |
| Network reinforcement | 2006-01-13 | Paper |
| Robust capacity planning in semiconductor manufacturing | 2005-09-22 | Paper |
| Separation of partition inequalities with terminals | 2005-08-22 | Paper |
| Near-optimal solutions to large-scale facility location problems | 2005-06-01 | Paper |
| Fractional Packing ofT-Joins | 2005-02-28 | Paper |
| Solving Steiner tree problems in graphs with Lagrangian relaxation | 2004-01-06 | Paper |
| On some difficult linear programs coming from set partitioning | 2002-05-15 | Paper |
| Separation of Partition Inequalities | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527180 | 2001-04-26 | Paper |
| The volume algorithm: Producing primal solutions with a subgradient method | 2000-08-14 | Paper |
| On the \(k\)-cut problem | 2000-05-17 | Paper |
| Plant location with minimum inventory | 1999-06-03 | Paper |
| Network Design Using Cut Inequalities | 1996-10-14 | Paper |
| On two-connected subgraph polytopes | 1996-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4857012 | 1995-11-26 | Paper |
| Packing Spanning Trees | 1995-06-14 | Paper |
| On the magnetisation of the ground states in two dimensional Ising spin glasses | 1995-02-09 | Paper |
| Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs | 1994-12-01 | Paper |
| Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor | 1994-12-01 | Paper |
| Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs | 1994-12-01 | Paper |
| Compositions of Graphs and Polyhedra II: Stable Sets | 1994-10-24 | Paper |
| Reducing Matching to Polynomial Size Linear Programming | 1994-02-07 | Paper |
| On cuts and matchings in planar graphs | 1993-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5288797 | 1993-10-19 | Paper |
| Separating from the dominant of the spanning tree polytope | 1993-01-16 | Paper |
| Design and Implementation of an Interactive Optimization System for Telephone Network Planning | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973411 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360020 | 1990-01-01 | Paper |
| Facets of the balanced (acyclic) induced subgraph polytope | 1989-01-01 | Paper |
| Experiments in quadratic 0-1 programming | 1989-01-01 | Paper |
| Note on Weintraub’s Minimum-Cost Circulation Algorithm | 1989-01-01 | Paper |
| An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design | 1988-01-01 | Paper |
| Exact arborescences, matchings and cycles | 1987-01-01 | Paper |
| A construction for binary matroids | 1987-01-01 | Paper |
| On the cycle polytope of a binary matroid | 1986-01-01 | Paper |
| A solvable case of quadratic 0-1 programming | 1986-01-01 | Paper |
| On the cut polytope | 1986-01-01 | Paper |
| Facets of the Bipartite Subgraph Polytope | 1985-01-01 | Paper |
| A submodular network simplex method | 1984-01-01 | Paper |
| The max-cut problem on graphs not contractible to \(K_ 5\) | 1983-01-01 | Paper |
| On some weakly bipartite graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911697 | 1981-01-01 | Paper |
