We stand with Ukraine  

Klaus Michael Wenger

According to our database1, Klaus Michael Wenger authored at least 5 papers between 2002 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Computing compatible tours for the symmetric traveling salesman problem.
[BibTeX]
[DOI]
Matteo Fortini
,
Adam N. Letchford
,
Andrea Lodi
,
Klaus Michael Wenger
Math. Program. Comput., 2011

2010
Generating partitions of a graph into a fixed number of minimum weight cuts.
[BibTeX]
[DOI]
Gerhard Reinelt
,
Klaus Michael Wenger
Discret. Optim., 2010

2008
Computing finest mincut partitions of a graph and application to routing problems.
[BibTeX]
[DOI]
Gerhard Reinelt
,
Dirk Oliver Theis
,
Klaus Michael Wenger
Discret. Appl. Math., 2008

2006
Maximally Violated Mod-<i>p</i> Cuts for the Capacitated Vehicle-Routing Problem.
[BibTeX]
[DOI]
Gerhard Reinelt
,
Klaus Michael Wenger
INFORMS J. Comput., 2006

2002
A New Approach to Cactus Construction Applied to TSP Support Graphs.
[BibTeX]
[DOI]
Klaus Michael Wenger
Proceedings of the Integer Programming and Combinatorial Optimization, 2002


  Loading...