Uwe T. Zimmermann

From MaRDI portal
Revision as of 08:35, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Uwe T. Zimmermann to Uwe T. Zimmermann: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1018087

Available identifiers

zbMath Open zimmermann.uwe-tDBLP43/4071WikidataQ2504903 ScholiaQ2504903MaRDI QIDQ1018087

List of research outcomes





PublicationDate of PublicationType
Flexible job shop scheduling with blockages2014-06-12Paper
Einführung in die Mathematische Optimierung2013-02-22Paper
Zonotopes and the LP-Newton method2009-08-12Paper
On minimum \(k\)-modal partitions of permutations2009-05-13Paper
On Minimum k-Modal Partitions of Permutations2008-09-18Paper
Cost optimal periodic train scheduling2006-10-27Paper
Shunting minimal rail car allocation2006-01-23Paper
https://portal.mardi4nfdi.de/entity/Q44505222004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q44505232004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q27625792002-01-09Paper
Real-time dispatch of trams in storage yards2001-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27625772001-01-01Paper
Optimal lines for railway systems1999-11-29Paper
A polynomial cycle canceling algorithm for submodular flows1999-01-01Paper
Discrete optimization in public rail transport1997-08-28Paper
Inequalities for the gamma function with applications to permanents1997-06-10Paper
https://portal.mardi4nfdi.de/entity/Q43326851997-02-13Paper
On the complexity of the dual method for maximum balanced flows1995-04-02Paper
Fast algorithms for the maximum convolution problem1994-10-10Paper
A combinatorial interior point method for network flow problems1992-12-17Paper
Negative circuits for flows and submodular flows1992-09-27Paper
Search directions for a class of projective methods1990-01-01Paper
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37862701988-01-01Paper
Duality for balanced submodular flows1986-01-01Paper
Linear and combinatorial sharing problems1986-01-01Paper
Sharing problems1986-01-01Paper
Nonlinear one-parametric bottleneck linear programming1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37258331985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822701984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36838501984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37068401984-01-01Paper
Minimization on submodular flows1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39427591982-01-01Paper
Minimization of Some Nonlinear Functions over Polymatroidal Network Flows1982-01-01Paper
Linear and combinatorial optimization in ordered algebraic structures1981-01-01Paper
Duality for algebraic linear programming1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38739611980-01-01Paper
Weakly admissible transformations for solving algebraic assignment and transportation problems1980-01-01Paper
Nonlinear one-parametric linear programming and t-norm transportation problems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38888691980-01-01Paper
An augmenting path method for solving linear bottleneck transportation problems1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38691121979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41998621979-01-01Paper
An augmenting path method for solving linear bottleneck assignment problems1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41591751978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41651611978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41875821978-01-01Paper
An algebraic approach to assignment problems1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41369311977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41566061977-01-01Paper

Research outcomes over time

This page was built for person: Uwe T. Zimmermann