Mechthild Stoer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

1999

Routing Through Virtual Paths in Layered Telecommunication NetworksGeir Dahl, Alexander Martin, Mechthild Stoer. ior, 47(5):693-702, 1999. [doi]

1998

A Cutting Plane Algorithm for Multicommodity Survivable Network Design ProblemsGeir Dahl, Mechthild Stoer. informs, 10(1):1-11, 1998. [doi]

1997

A simple min-cut algorithmMechthild Stoer, Frank Wagner. JACM, 44(4):585-591, 1997. [doi]

1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability RequirementsMartin Grötschel, Clyde L. Monma, Mechthild Stoer. ior, 43(6):1012-1024, 1995. [doi]

1994

A Simple Min Cut AlgorithmMechthild Stoer, Frank Wagner. esa 1994: 141-147

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. siamjo, 3(1):25-42, 1993. [doi]

1992

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity ConstraintsMartin Grötschel, Clyde L. Monma, Mechthild Stoer. siamjo, 2(3):474-504, 1992. [doi]

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity ConstraintsMartin Grötschel, Clyde L. Monma, Mechthild Stoer. ior, 40(2):309-330, 1992. [doi]

1990

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering ProblemNorbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer. ipco 1990: 19-28

1989

Polyhedral Approaches to Network SurvivabilityMartin Grötschel, Clyde L. Monma, Mechthild Stoer. dimacs 1991: 121-142

Sign in or sign up to see more results.

runs on WebDSL