Pages that link to "Item:Q5463408"
From MaRDI portal
The following pages link to Finding minimum congestion spanning trees (Q5463408):
Displaying 8 items.
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Convergence Dynamics of Graphical Congestion Games (Q2840915) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
