| Publication | Date of Publication | Type |
|---|
| A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems | 2018-08-17 | Paper |
| A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph | 2016-06-09 | Paper |
| An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme | 2016-06-01 | Paper |
| Trioid: a generalization of matroid and the associated polytope | 2013-12-11 | Paper |
| 2-commodity integer network synthesis problem | 2013-12-11 | Paper |
| Infeasibility analysis for linear systems, a survey | 2013-09-11 | Paper |
| Spanning cactus of a graph: Existence, extension, optimization, and approximation | 2012-11-22 | Paper |
| The minimum spanning tree problem with conflict constraints and its variations | 2012-06-20 | Paper |
| An \(O(n^{4})\) algorithm for the QAP linearization problem | 2012-05-24 | Paper |
| Integer Exact Network Synthesis Problem | 2010-03-17 | Paper |
| Integer version of the multipath flow network synthesis problem | 2009-03-04 | Paper |
| A strongly polynomial simplex method for the linear fractional assignment problem | 2009-03-04 | Paper |
| Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix | 2008-12-01 | Paper |
| VLSN search algorithms for partitioning problems using matching neighbourhoods | 2008-07-29 | Paper |
| Geometric problems in automated manufacturing. | 2008-01-25 | Paper |
| On cost matrices with two and three distinct values of Hamiltonian paths and cycles | 2007-11-16 | Paper |
| Flows over edge-disjoint mixed multipaths and applications | 2007-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755527 | 2007-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755531 | 2007-08-13 | Paper |
| An improved algorithm for decomposing arc flows into multipath flows | 2006-01-18 | Paper |
| Multiroute flows: cut-trees and realizability | 2006-01-09 | Paper |
| Multi-terminal multipath flows: synthesis | 2004-11-23 | Paper |
| Fuzzy disk for covering fuzzy points | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461913 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461917 | 2004-05-18 | Paper |
| Weighted graphs with all Hamiltonian cycles of the same length | 2003-09-25 | Paper |
| TSP heuristics: domination analysis and complexity | 2003-06-02 | Paper |
| Fuzzy models for single-period inventory problem | 2003-04-02 | Paper |
| New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization | 2002-06-24 | Paper |
| Domination analysis of some heuristics for the traveling salesman problem | 2002-06-24 | Paper |
| Fuzzy versions of the covering circle problem | 2002-02-20 | Paper |
| Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey | 2002-02-19 | Paper |
| Integer solution for linear complementarity problem | 2001-11-26 | Paper |
| Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions. | 2001-09-27 | Paper |
| Gilmore-Gomory type traveling salesman problems | 2000-07-27 | Paper |
| Pyramidal traveling salesman problem | 1999-09-22 | Paper |
| A generalization of the convex-hull-and-line traveling salesman problem | 1999-08-19 | Paper |
| Ratio combinatorial programs | 1998-08-16 | Paper |
| Clustering problems in optimization models | 1997-01-22 | Paper |
| An extension of a theorem of Fulkerson and Gross | 1996-12-01 | Paper |
| \(\varepsilon\)-approximation minimization of convex functions in fixed dimension | 1996-08-01 | Paper |
| On Optimal Replacement Policies—Random Horizon | 1994-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973407 | 1992-06-26 | Paper |
| A problem in vision that is polynomially solvable | 1991-01-01 | Paper |
| On totally dual integral systems | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197593 | 1990-01-01 | Paper |
| Pseudomatroids | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779569 | 1988-01-01 | Paper |
| Some NP-complete problems in quadratic and nonlinear programming | 1987-01-01 | Paper |
| Strongly polynomial algorithm for a class of combinatorial LCPs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779966 | 1987-01-01 | Paper |
| Some NP-complete problems in linear programming | 1982-01-01 | Paper |
