Pages that link to "Item:Q5348461"
From MaRDI portal
The following pages link to Complexity and Approximation of the Continuous Network Design Problem (Q5348461):
Displaying 7 items.
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- A tri-level optimization model for a private road competition problem with traffic equilibrium constraints (Q1991277) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- The Continuous-Time Service Network Design Problem (Q4598647) (← links)
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Stackelberg pricing games with congestion effects (Q6120892) (← links)