default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe T. Zimmermann
Person information
- affiliation: Braunschweig University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j14]Ronny S. Hansmann, Thomas Rieger, Uwe T. Zimmermann:
Flexible job shop scheduling with blockages. Math. Methods Oper. Res. 79(2): 135-161 (2014)
2000 – 2009
- 2009
- [i1]Ronny S. Hansmann, Uwe T. Zimmermann:
Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part I). Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j13]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke
, Uwe T. Zimmermann:
On minimum k-modal partitions of permutations. J. Discrete Algorithms 6(3): 381-392 (2008) - 2006
- [c2]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann:
On Minimum k-Modal Partitions of Permutations. LATIN 2006: 374-385 - 2005
- [j12]Marco E. Lübbecke, Uwe T. Zimmermann:
Shunting Minimal Rail Car Allocation. Comput. Optim. Appl. 31(3): 295-308 (2005) - [j11]Thomas Lindner, Uwe T. Zimmermann:
Cost optimal periodic train scheduling. Math. Methods Oper. Res. 62(2): 281-295 (2005) - 2003
- [j10]Marco E. Lübbecke, Uwe T. Zimmermann:
Engine Routing and Scheduling at Industrial In-Plant Railroads. Transp. Sci. 37(2): 183-197 (2003) - 2000
- [j9]Thomas Winter, Uwe T. Zimmermann:
Real-time dispatch of trams in storage yards. Ann. Oper. Res. 96(1-4): 287-315 (2000)
1990 – 1999
- 1999
- [j8]Claus Wallacher, Uwe T. Zimmermann:
A polynomial cycle canceling algorithm for submodular flows. Math. Program. 86(1): 1-15 (1999) - 1998
- [c1]Thomas Winter, Uwe T. Zimmermann:
Discrete Online and Real-Time Optimization. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 31-48 - 1997
- [j7]Michael R. Bussieck, Thomas Winter, Uwe T. Zimmermann:
Discrete optimization in public rail transport. Math. Program. 79: 415-444 (1997) - 1996
- [j6]Peter J. Grabner, Robert F. Tichy, Uwe T. Zimmermann:
Inequalities for the gamma function with applications to permanents. Discret. Math. 154(1-3): 53-62 (1996) - [j5]Uwe T. Zimmermann:
Discrete optimization. Math. Methods Oper. Res. 43(2): 141-142 (1996) - 1994
- [j4]Uwe T. Zimmermann:
On the complexity of the dual method for maximum balanced flows. Discret. Appl. Math. 50(1): 77-88 (1994) - [j3]Michael R. Bussieck, Hannes Hassler, Gerhard J. Woeginger, Uwe T. Zimmermann:
Fast algorithms for the maximum convolution problem. Oper. Res. Lett. 15(3): 133-141 (1994) - 1992
- [j2]Uwe T. Zimmermann:
Negative circuits for flows and submodular flows. Discret. Appl. Math. 36(2): 179-189 (1992) - [j1]Claus Wallacher, Uwe T. Zimmermann:
A combinatorial interior point method for network flow problems. Math. Program. 56: 321-335 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
