Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Mechthild Stoer
Observed name:
M. Stoer
Institution:
Telenor (Norway)
Observed institutions:
Zuse Institute Berlin,
Telenor (Norway)
OpenAlex ID:
A5026406330
A simple min-cut algorithm
1997
·
Mechthild Stoer
, Frank Wagner
·
Journal of the ACM
·
879
PDF
Design of Survivable Networks
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
·
413
Chapter 10 Design of survivable networks
1995
·
M. Grötschel
, C.L. Monma
, et al.
·
Handbooks in operations research and management science
·
217
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
1992
·
Martin Grötschel
, Clyde L. Monma
, et al.
·
Operations Research
·
203
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
1998
·
Geir Dahl
, Mechthild Stoer
·
INFORMS journal on computing
·
142
A polyhedral approach to multicommodity survivable network design
1994
·
Mechthild Stoer
, Geir Dahl
·
Numerische Mathematik
·
130
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
1992
·
Martin Grötschel
, Clyde L. Monma
, et al.
·
SIAM Journal on Optimization
·
101
A simple min cut algorithm
1994
·
Mechthild Stoer
, Frank Wagner
·
Lecture notes in computer science
·
95
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
1995
·
M. Grötschel
, C. L. Monma
, et al.
·
Operations Research
·
90
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
1993
·
N. Ascheuer
, L. F. Escudero
, et al.
·
SIAM Journal on Optimization
·
77
Polyhedral approaches to network survivability
1991
·
M. Grötschel
, C. Monma
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
65
Routing Through Virtual Paths in Layered Telecommunication Networks
1999
·
Geir Dahl
, Alexander Martin
, et al.
·
Operations Research
·
52
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem
1990
·
Norbert Ascheuer
, Laureano F. Escudero
, et al.
·
OPUS (Augsburg University)
·
17
Survivable network design under connectivity constraints — a survey
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
·
10
A cutting plane algorithm for multicomoodity survivable network design problems
1995
·
Geir Dahl
, Mechthild Stoer
·
NORA - Norwegian Open Research Archives
·
1
A Cutting Plane Algorithm for the Design of survivable Networks
1992
·
Mechthild Stoer
·
Operations research proceedings
·
1
Computational results
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
·
1
Modelle und Methoden zur Konstruktion ausfallsicherer Netzwerke
1995
·
Mechthild Stoer
·
Springer eBooks
Experiences with a Cutting Plane Algorithm in Survivable Network Design
1993
·
Mechthild Stoer
·
Physica-Verlag eBooks
A Polyhedral Approach to Network Connectivity Problems (Extended Abstract).
1992
·
Martin Grötschel
, Clyde Monma
, et al.
Network survivability models using node types
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
How to find valid inequalities
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
Lifted r-cover inequalities
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
Implementation of the cutting plane algorithm
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
Node partition inequalities
1992
·
Mechthild Stoer
·
Lecture notes in mathematics
Show more works
View as search
Works count:
35
Citation count:
2,503
H-index:
13
I10-index:
14
Year
Topic
Type