Pages that link to "Item:Q3675933"
From MaRDI portal
The following pages link to The traveling salesman problem on a graph and some related integer polyhedra (Q3675933):
Displaying 10 items.
- Branch and cut methods for network optimization (Q5936762) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- The Steiner bi-objective shortest path problem (Q6114902) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
- The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies (Q6617071) (← links)