Grtschel M.

M. Grtschel

Information about the author M. Grtschel will soon be added to the site.
Found 12 papers in total
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
2001
Many optimization problems have several equivalent mathematical models. It is often...
Order picking in an automatic warehouse: Solving online asymmetric travelling salesman problems
Order picking in an automatic warehouse: Solving online asymmetric travelling salesman problems
1999
We report on a joint project with industry that had the aim to sequence transportation...
The Steiner tree packing problem in VLSI design
The Steiner tree packing problem in VLSI design
1997
In this paper we describe several versions of the routing problem arising in VLSI...
Packing Steiner trees: Polyhedral investigations
Packing Steiner trees: Polyhedral investigations
1996
Let G=(V,E) be a graph and T⊆V be a node set. The authors call an edge set S a...
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
Routing in grid graphs by cutting planes
Routing in grid graphs by cutting planes
1995
In this paper the authors study the following problem, which they call the weighted...
Some integer programs arising in the design of main frame computers
Some integer programs arising in the design of main frame computers
1993
In this paper the authors describe and discuss a problem that arises in the (global)...
A cutting plane method for the windy postman problem
A cutting plane method for the windy postman problem
1992
In this paper the authors describe a cutting plane algorithm for the (NP-hard) windy...
Optimal control of plotting and drilling machines: A case study
Optimal control of plotting and drilling machines: A case study
1991
Printed circuit board production is one of the basic technologies of electronics...
Facets of the clique partitioning polytope
Facets of the clique partitioning polytope
1990
A subset A of the edge set of a graph is called a clique partitioning of G if there is...
A cutting plane algorithm for a clustering problem
A cutting plane algorithm for a clustering problem
1989
In this paper the authors consider a clustering problem that arises in qualitative...
Decomposition and optimization over cycles in binary matroids
Decomposition and optimization over cycles in binary matroids
1989
For k =2 and 3, the authors define several k- sums of binary matroids and of...
Papers per page: