Pages that link to "Item:Q3405968"
From MaRDI portal
The following pages link to PRICING GEOMETRIC TRANSPORTATION NETWORKS (Q3405968):
Displaying 5 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Locating a single facility and a high-speed line (Q299840) (← links)
- Weber problems with high-speed lines (Q611010) (← links)
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition (Q622107) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
