The following pages link to Martin Grötschel (Q202055):
Displaying 30 items.
- (Q4308287) (← links)
- (Q4353136) (← links)
- (Q4384100) (← links)
- (Q4384118) (← links)
- (Q4384127) (← links)
- (Q4450520) (← links)
- (Q4472434) (← links)
- (Q4494399) (← links)
- (Q4517675) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) (Q4697307) (← links)
- (Q4699387) (← links)
- (Q4763406) (← links)
- Frequency planning and ramifications of coloring (Q4786789) (← links)
- Routing in grid graphs by cutting planes (Q4845139) (← links)
- (Q4845372) (← links)
- Combinatorial optimization (Q4871776) (← links)
- (Q4871785) (← links)
- Packing Steiner Trees: Separation Algorithms (Q4881289) (← links)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements (Q4887724) (← links)
- (Q4950119) (← links)
- Optimal control of plotting and drilling machines: A case study (Q5202834) (← links)
- (Q5288833) (← links)
- (Q5301726) (← links)
- (Q5465112) (← links)
- (Q5706097) (← links)
- Introduction (Q5894008) (← links)
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
- Introduction (Q5970652) (← links)
- Optimization Stories (Q6062452) (← links)