Pages that link to "Item:Q2452379"
From MaRDI portal
The following pages link to Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379):
Displaying 4 items.
- Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (Q1792597) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
