The following pages link to Martin Grötschel (Q202055):
Displaying 50 items.
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Facets of the clique partitioning polytope (Q752015) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- \texttt{MATHEON}: Introducing the DFG research center ``Mathematics for key technologies'' in Berlin (Q814165) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Discrete mathematics and its applications: On the road to an authentical mathematics education (Q1018276) (← links)
- (Q1078186) (redirect page) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (Q1147716) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Weakly bipartite graphs and the max-cut problem (Q1169411) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- Order picking in an automatic warehouse: Solving online asymmetric TSPs (Q1304425) (← links)
- Geometric algorithms and combinatorial optimization. (Q1309040) (← links)
- The Steiner tree packing problem in VLSI design (Q1373751) (← links)
- Cost-efficient network synthesis from leased lines (Q1383114) (← links)
- Frequency assignment in cellular phone networks (Q1383122) (← links)
- \(\mathcal P = \mathcal{NP}\)? (Q1404168) (← links)
- The representation of polyhedra by polynomial inequalities (Q1404517) (← links)
- Polynomial inequalities representing polyhedra (Q1777221) (← links)
- A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- Packing Steiner trees: Further facets (Q1908272) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Optimum path packing on wheels: The consecutive case (Q1921239) (← links)
- Euler, Mei-ko Kwan, Königsberg, and a Chinese postman (Q1946007) (← links)
- Flinders Petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeology (Q1946020) (← links)
- Stories about the old masters of optimization (Q1946072) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- (Q2762577) (← links)
- (Q2762578) (← links)
- (Q2822304) (← links)
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem (Q3030581) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
- On minimal strong blocks (Q3048865) (← links)
- Planning Problems in Public Transit (Q3064910) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Via Minimization with Pin Preassignments and Layer Preference (Q3197850) (← links)
- (Q3205246) (← links)
- (Q3206661) (← links)
- (Q3216686) (← links)
- A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947) (← links)
