K. Truemper

发表

On Max Flows with Gains and Pure Min-Cost Flows

K. Truemper, 1977 .

Note on Finite Convergence of Exterior Penalty Functions

K. Truemper, 1975 .

Algebraic Characterizations of Unimodular Matrices

Klaus Truemper, K. Truemper, 1978 .

A Solver for Quantied Formula Problem Q-ALL SAT

K. Truemper, Anja Remshagen, 2008 .

Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch

K. Truemper, G. Liuzzi, 2018 .

Complement total unimodularity

Klaus Truemper, K. Truemper, 1980 .

Optimization in Interactive Expert Systems

K. Truemper, 1998 .

Eecient Algorithms for Classes of the Futile Questioning Problem

K. Truemper, 1998 .

Decomposition and optimization over cycles in binary matroids

Klaus Truemper, Martin Grötschel, M. Grötschel, 1989, J. Comb. Theory, Ser. B.

Master Polytopes for Cycles of Binary Matroids* M. Gratschel lnstitut fiir Mathematik

K. Truemper, Universitiit Augsburg, Memminger Strasse, 1989 .

Subgroup Discovery Method SUBARP

K. Truemper, 2015 .

Simple Seeding of Evolutionary Algorithms for Hard Multiobjective Minimization Problems

K. Truemper, 2014 .

Dimension Reduction of Chemical Process Simulation Data

G. Janiga, K. Truemper, 2010 .

L the Lsquare System for Mining Logic Data the Lsquare System for Mining Logic Data

G. Felici, K. Truemper, 2015 .

Learning Logic Formulas and Related Error Distributions

Klaus Truemper, Giovanni Felici, Fu-Shing Sun, 2006 .

A MINSAT Approach for Learning in Logic Domains

Klaus Truemper, Giovanni Felici, G. Felici, 2002, INFORMS J. Comput..

Data-driven subclassification of speech sound disorders in preschool children.

Klaus Truemper, Christopher A Moore, Thomas F Campbell, 2014, Journal of speech, language, and hearing research : JSLHR.

Design of logic-based intelligent systems

Klaus Truemper, K. Truemper, 2004 .

Matroid decomposition

Klaus Truemper, K. Truemper, 1992 .

Polynomial algorithms for a class of linear programs

Klaus Truemper, Jean François Maurras, M. Akgül, 1981, Math. Program..

The Needles-in-Haystack Problem

Klaus Truemper, Katherine Moreland, K. Truemper, 2009, MLDM.

Local unimodularity of matrix-vector pairs

Klaus Truemper, Ramaswamy Chandrasekaran, R. Chandrasekaran, 1978 .

A decomposition theory for matroids. VII. Analysis of minimal violation matrices

Klaus Truemper, K. Truemper, 1992, J. Comb. Theory, Ser. B.

Alpha-balanced graphs and matrices and GF(3)-representability of matroids

Klaus Truemper, K. Truemper, 1982, J. Comb. Theory, Ser. B.

Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks

K. Truemper, Y. Soun, K. Truemper, 1979, Math. Oper. Res..

Implementation of a unimodularity test

Klaus Truemper, Matthias Walter, K. Truemper, 2012, Math. Program. Comput..

A decomposition theory for matroids. VI. Almost regular matroids

Klaus Truemper, K. Truemper, 1992, J. Comb. Theory, Ser. B.

A decomposition theory for matroids. V. Testing of matrix total unimodularity

Klaus Truemper, K. Truemper, 1990, J. Comb. Theory, Ser. B.

Master polytopes for cycles of binary matroids

Klaus Truemper, Martin Grötschel, M. Grötschel, 1989 .

A decomposition theory for matroids IV. Decomposition of graphs

Klaus Truemper, K. Truemper, 1988, J. Comb. Theory, Ser. B.

A decomposition theory for matroids III. Decomposition conditions

K. TRUEMPER, K. Truemper, 1986, J. Comb. Theory, Ser. B.

A decomposition of the matroids with the max-flow min-cut property

Klaus Truemper, F. T. Tseng, K. Truemper, 1986, Discret. Appl. Math..

A decomposition theory for matroids. II. Minimal violation matroids

Klaus Truemper, K. Truemper, 1985, J. Comb. Theory, Ser. B.

A decomposition theory for matroids. I. General results

Klaus Truemper, K. Truemper, 1985, J. Comb. Theory, Ser. B.

Partial Matroid Representations

Klaus Truemper, K. Truemper, 1984, Eur. J. Comb..

On the Efficiency of Representability Tests for Matroids

Klaus Truemper, K. Truemper, 1982, Eur. J. Comb..

Design of Logic-based Intelligent Systems: Truemper/Intelligent Systems

Klaus Truemper, K. Truemper, 2005 .

Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes

Klaus Truemper, K. Truemper, 1987, Math. Oper. Res..

Unimodular matrices of flow problems with additional constraints

Klaus Truemper, K. Truemper, 1977, Networks.

An efficient scaling procedure for gain networks

Klaus Truemper, K. Truemper, 1976, Networks.

Logic Integer Programming Models for Signaling Networks

Klaus Truemper, Robert Weismantel, Utz-Uwe Haus, 2008, J. Comput. Biol..

Construction of Deterministic , Consistent , and Stable Explanations from Numerical Data and Prior Domain Knowledge

Klaus Truemper, K. Truemper, Katrina Riehl Enthought, 2007 .

On the delta-wye reduction for planar graphs

Klaus Truemper, K. Truemper, 1989, J. Graph Theory.

An Effective QBF Solver for Planning Problems

Klaus Truemper, Anja Remshagen, Charles Otwell, 2004, MSV/AMCS.

Discretization of Target Attributes for Subgroup Discovery

Klaus Truemper, Katherine Moreland, K. Truemper, 2009, MLDM.

Lsquare System for Mining Logic Data

Klaus Truemper, Giovanni Felici, G. Felici, 2005 .

Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks

Klaus Truemper, Robert Weismantel, Utz-Uwe Haus, 2008, J. Satisf. Boolean Model. Comput..

Effective logic computation

Klaus Truemper, K. Truemper, 1998 .

On Whitney's 2-isomorphism theorem for graphs

Klaus Truemper, K. Truemper, 1980, J. Graph Theory.

Nonmonotonic and Incomplete Reasoning

Klaus Truemper, K. Truemper, 2005 .