The following pages link to Martin Grötschel (Q202055):
Displaying 11 items.
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- (Q3318807) (← links)
- (Q3328286) (← links)
- (Q3329225) (← links)
- (Q3342610) (← links)
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints (Q3352817) (← links)
- "Einsteins Notizblock". BertelsmannSpringer und die Zukunft der wissenschaftlichen Publikation (Q3465529) (← links)
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (Q4004739) (← links)
- Frequency planning and ramifications of coloring (Q4786789) (← links)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements (Q4887724) (← links)
- Optimization Stories (Q6062452) (← links)
