Pages that link to "Item:Q1821798"
From MaRDI portal
The following pages link to A cutting plane algorithm for minimum perfect 2-matchings (Q1821798):
Displayed 10 items.
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Euclidean semi-matchings of random samples (Q1184341) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)