| Publication | Date of Publication | Type |
|---|
| Maintenance scheduling for modular systems: Modeling and algorithms | 2019-05-02 | Paper |
| Maintenance and flight scheduling of low observable aircraft | 2019-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635958 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635959 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635960 | 2018-04-23 | Paper |
| A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems | 2012-02-19 | Paper |
| Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems | 2012-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3056948 | 2010-11-23 | Paper |
| Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs | 2009-08-13 | Paper |
| Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type | 2009-07-03 | Paper |
| Facets and Reformulations for Solving Production Planning With Changeover Costs | 2009-07-03 | Paper |
| Combined route capacity and route length models for unit demand vehicle routing problems | 2008-10-29 | Paper |
| An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees | 2007-02-05 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Solving variational inequality and fixed point problems by line searches and potential optimization | 2005-02-24 | Paper |
| A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees | 2005-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4811406 | 2004-09-06 | Paper |
| Connectivity-splitting models for survivable network design | 2004-02-03 | Paper |
| Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems | 2003-09-15 | Paper |
| Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees | 2003-05-22 | Paper |
| Telecommunication link restoration planning with multiple facility types | 2002-06-09 | Paper |
| Designing hierarchical survivable networks | 2002-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398375 | 1998-07-19 | Paper |
| Averaging Schemes for Variational Inequalities and Systems of Equations | 1997-10-28 | Paper |
| The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms | 1997-10-05 | Paper |
| Heuristics, LPs, and Trees on Trees: Network Design Analyses | 1997-01-07 | Paper |
| Optimizing constrained subtrees of trees | 1996-10-03 | Paper |
| A unifying geometric solution framework and complexity analysis for variational inequalities | 1996-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845371 | 1996-06-23 | Paper |
| Modeling and Solving the Two-Facility Capacitated Network Loading Problem | 1995-08-01 | Paper |
| A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning | 1995-08-01 | Paper |
| Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem | 1995-07-13 | Paper |
| A Dual-Based Algorithm for Multi-Level Network Design | 1994-08-21 | Paper |
| The convex hull of two core capacitated network design problems | 1993-12-06 | Paper |
| Shortest paths, single origin‐destination network design, and associated polyhedra | 1993-09-05 | Paper |
| Sensitivity Analysis for Variational Inequalities | 1993-01-16 | Paper |
| A Polyhedral Intersection Theorem for Capacitated Spanning Trees | 1993-01-16 | Paper |
| Some Recent Advances in Network Flows | 1991-01-01 | Paper |
| A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs | 1990-01-01 | Paper |
| Routing and Scheduling on a Shoreline with Release Times | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352833 | 1990-01-01 | Paper |
| Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics | 1990-01-01 | Paper |
| Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets | 1989-01-01 | Paper |
| Valid inequalities and facets of the capacitated plant location problem | 1989-01-01 | Paper |
| A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design | 1989-01-01 | Paper |
| Facets and algorithms for capacitated lot sizing | 1989-01-01 | Paper |
| Designing satellite communication networks by zero—one quadratic programming | 1989-01-01 | Paper |
| Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780724 | 1988-01-01 | Paper |
| Parametric linear programming and anti-cycling pivoting rules | 1988-01-01 | Paper |
| Generalized Descent Methods for Asymmetric Systems of Equations | 1987-01-01 | Paper |
| Tailoring Benders decomposition for uncapacitated network design | 1986-01-01 | Paper |
| Approximation Methods for the Uncapacitated Dynamic Lot Size Problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734142 | 1984-01-01 | Paper |
| Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria | 1981-01-01 | Paper |
| Equilibria on a Congested Transportation Network | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875725 | 1980-01-01 | Paper |
| The structure of admissible points with respect to cone dominance | 1979-01-01 | Paper |
| Deterministic network optimization: A bibliography | 1977-01-01 | Paper |
| Duality and Sensitivity Analysis for Fractional Programs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111040 | 1976-01-01 | Paper |
| Some Abstract Pivot Algorithms | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109502 | 1975-01-01 | Paper |
| Fenchel and Lagrange duality are equivalent | 1974-01-01 | Paper |
| On the number of latent subsets of intersecting collections | 1974-01-01 | Paper |
| Complementary bases of a matroid | 1974-01-01 | Paper |
| Complementary Trees and Independent Matchings | 1974-01-01 | Paper |
