Mechthild Stoer

According to our database, Mechthild Stoer authored at least 9 papers between 1989 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1999

Routing Through Virtual Paths in Layered Telecommunication Networks.

Geir Dahl, Alexander Martin, Mechthild Stoer

Oper. Res., 1999

1998

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems.

Geir Dahl, Mechthild Stoer

INFORMS J. Comput., 1998

1997

A simple min-cut algorithm.

Mechthild Stoer, Frank Wagner

J. ACM, 1997

1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Oper. Res., 1995

1993

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing).

Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer

SIAM J. Optim., 1993

1992

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

SIAM J. Optim., 1992

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Oper. Res., 1992

1990

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.

Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Polyhedral Approaches to Network Survivability.

Martin Grötschel, Clyde L. Monma, Mechthild Stoer

Proceedings of the Reliability Of Computer And Communication Networks, 1989