Pages that link to "Item:Q3464060"
From MaRDI portal
The following pages link to Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060):
Displayed 8 items.
- Station assignment with reallocation (Q666668) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs (Q2988851) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Routing and scheduling for energy and delay minimization in the powerdown model (Q5326790) (← links)
- Stackelberg pricing games with congestion effects (Q6120892) (← links)