| Publication | Date of Publication | Type |
|---|
| Reformulation and decomposition approaches for traffic routing in optical networks | 2018-05-23 | Paper |
| Energy-efficient service function chain provisioning | 2018-04-11 | Paper |
| Towards optimal and scalable solution for routing and spectrum allocation | 2018-04-11 | Paper |
| Pushing the boundaries of reasoning about qualified cardinality restrictions | 2018-01-04 | Paper |
| A dynamic row/column management algorithm for freight train scheduling | 2012-10-02 | Paper |
| An anytime deduction algorithm for the probabilistic logic and entailment problems | 2010-04-07 | Paper |
| On column generation formulations for the RWA problem | 2009-06-23 | Paper |
| A column generation and branch-and-cut algorithm for the channel assignment problem | 2008-09-01 | Paper |
| ILP formulations for the routing and wavelength assignment problem: symmetric systems | 2007-07-23 | Paper |
| Equivalence of some LP-based lower bounds for the Golomb ruler problem | 2006-01-10 | Paper |
| A tabu search algorithm for difference triangle sets and Golomb rulers | 2005-11-01 | Paper |
| Maximum split clustering under connectivity constraints | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550775 | 2003-06-18 | Paper |
| Probabilistic satisfiability with imprecise probabilities | 2002-07-23 | Paper |
| Comparison of column generation models for channel assignment in cellular networks | 2002-07-04 | Paper |
| Erratum to ``Comparison of column generation models for channel assignment in cellular networks | 2002-06-24 | Paper |
| On the convergence of cone splitting algorithms with \(\omega\)-subdivisions | 2002-05-29 | Paper |
| Polynomial algorithms for nested univariate clustering | 2002-05-15 | Paper |
| Enumeration of all extreme equilibria of bimatrix games | 2002-04-15 | Paper |
| Design of an efficient channel block retuning | 2002-03-20 | Paper |
| Concavity cuts for disjoint bilinear programming | 2002-02-21 | Paper |
| Solution of the multisource Weber and conditional Weber problems by d. -c. programming | 2002-02-07 | Paper |
| The assignment problem with seniority and job priority constraints | 2002-02-07 | Paper |
| A branch and cut algorithm for nonconvex quadratically constrained quadratic programming | 2001-08-20 | Paper |
| New algorithms for product positioning | 2001-02-22 | Paper |
| A symmetrical linear maxmin approach to disjoint bilinear programming | 2000-11-12 | Paper |
| An Interior Point Algorithm for Minimum Sum-of-Squares Clustering | 2000-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955459 | 2000-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4493256 | 2000-08-03 | Paper |
| On lower bounds for numbered complete graphs | 2000-07-25 | Paper |
| NASH EQUILIBRIA FROM THE CORRELATED EQUILIBRIA VIEWPOINT | 2000-06-19 | Paper |
| Best second order bounds for two-terminal network reliability with dependent edge failures | 2000-01-17 | Paper |
| Probabilistic satisfiability | 2000-01-01 | Paper |
| Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem | 1999-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247431 | 1999-10-31 | Paper |
| A simplified convergence proof for the cone partitioning algorithm | 1999-07-21 | Paper |
| A generalized linear programming model for nurse scheduling | 1999-07-11 | Paper |
| An algorithm for Weber's problem on the sphere | 1999-02-22 | Paper |
| Minimum sum of squares clustering in a low dimensional space | 1998-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394984 | 1998-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394601 | 1998-06-11 | Paper |
| Cluster analysis and mathematical programming | 1998-05-25 | Paper |
| Links between linear bilevel and mixed 0-1 programming problems | 1998-03-05 | Paper |
| On-line 2-satisfiability | 1997-11-09 | Paper |
| Generalized convex multiplicative programming via quasiconcave minimization | 1997-06-24 | Paper |
| Espaliers: A generalization of dendrograms | 1997-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687268 | 1996-12-11 | Paper |
| Global optimization of Hölder functions | 1996-07-23 | Paper |
| Complexity of Product Positioning and Ball Intersection Problems | 1996-06-09 | Paper |
| Boole's conditions of possible experience and reasoning under uncertainty | 1996-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326921 | 1995-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4833810 | 1995-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326919 | 1995-03-27 | Paper |
| Finding maximum likelihood estimators for the three-parameter Weibull distribution | 1995-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302077 | 1995-01-15 | Paper |
| Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation | 1994-10-30 | Paper |
| Cord-slope form of Taylor's expansion in univariate global optimization | 1994-10-27 | Paper |
| Local optima topology for the \(k\)-coloring problem | 1994-07-18 | Paper |
| A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing | 1994-07-18 | Paper |
| Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions | 1994-01-13 | Paper |
| A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives | 1994-01-01 | Paper |
| Penalty computations for the set partitioning problem | 1993-12-20 | Paper |
| State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming | 1993-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697332 | 1993-06-29 | Paper |
| Column Generation Methods for Probabilistic Logic | 1993-02-18 | Paper |
| New Branch-and-Bound Rules for Linear Bilevel Programming | 1993-01-16 | Paper |
| Global optimization of univariate Lipschitz functions. I: Survey and properties | 1993-01-16 | Paper |
| Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison | 1993-01-16 | Paper |
| Reduction of indefinite quadratic programs to bilinear programs | 1992-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3986703 | 1992-06-27 | Paper |
| An analytical approach to global optimization | 1992-06-27 | Paper |
| On-line and off-line vertex enumeration by adjacency lists | 1992-06-27 | Paper |
| On Timonov's algorithm for global optimization of univariate Lipschitz functions | 1992-06-26 | Paper |
| Efficient algorithms for divisive hierarchical clustering with the diameter criterion | 1992-06-25 | Paper |
| Algorithms for the maximum satisfiability problem | 1990-01-01 | Paper |
| The basic algorithm for pseudo-Boolean programming revisited | 1990-01-01 | Paper |
| A decomposition method for minimizing quadratic pseudo-Boolean functions | 1989-01-01 | Paper |
| Global minimization of univariate functions by sequential polynomial approximation | 1989-01-01 | Paper |
| Finite precision design of FIR digital filters using a convexity property | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775339 | 1988-01-01 | Paper |
| On the complexity of the maximum satisfiability problem for Horn formulas | 1987-01-01 | Paper |
| Product form parametric representation of the solutions to a quadratic boolean equation | 1987-01-01 | Paper |
| A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities | 1986-01-01 | Paper |
| An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs | 1986-01-01 | Paper |
| Uniquely solvable quadratic Boolean equations | 1985-01-01 | Paper |
