The following pages link to Stefan Thienel (Q1271385):
Displaying 8 items.
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. (Q1611005) (← links)
- (Q1969950) (redirect page) (← links)
- Practical performance of efficient minimum cut algorithms (Q1969951) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- (Q4840772) (← links)
