The following pages link to Martin Grötschel (Q202055):
Displaying 50 items.
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- (Q3318807) (← links)
- (Q3328286) (← links)
- Geometric methods in combinatorial optimization (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)
- (Q3525436) (← links)
- (Q3645577) (← links)
- (Q3677508) (← links)
- (Q3680606) (← links)
- On the acyclic subgraph polytope (Q3698818) (← links)
- Facets of the linear ordering polytope (Q3698819) (← links)
- Facets of the Bipartite Subgraph Polytope (Q3699730) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
- (Q3714900) (← links)
- (Q3714901) (← links)
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963) (← links)
- (Q3835306) (← links)
- (Q3866149) (← links)
- On the symmetric travelling salesman problem: Solution of a 120-city problem (Q3875699) (← links)
- (Q3875956) (← links)
- The graphs for which all strong orientations are hamiltonian (Q3884132) (← links)
- On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets (Q3885529) (← links)
- (Q3893663) (← links)
- Characterizations of adjacency of faces of polyhedra (Q3896843) (← links)
- Hypotraceable digraphs (Q3900092) (← links)
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets (Q3920990) (← links)
- (Q3934415) (← links)
- (Q3939599) (← links)
- (Q3944353) (← links)
- (Q3945154) (← links)
- (Q3958289) (← links)
- Composition of facets of the clique partitioning polytope (Q3972001) (← links)
- Complete descriptions of small multicut polytopes (Q3974969) (← links)
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (Q4004739) (← links)
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints (Q4018839) (← links)
- Clique-Web Facets for Multicut Polytopes (Q4027782) (← links)
- (Q4035361) (← links)
- (Q4074669) (← links)
- (Q4083474) (← links)
- Partial linear characterizations of the asymmetric travelling salesman polytope (Q4119036) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- (Q4133659) (← links)
- A property of continuous unbounded algorithms (Q4160691) (← links)
- (Q4173148) (← links)
- (Q4173190) (← links)
- (Q4174517) (← links)
- (Q4189319) (← links)
- (Q4234161) (← links)
