Pages that link to "Item:Q325472"
From MaRDI portal
The following pages link to A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472):
Displaying 9 items.
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- (Q3400615) (← links)
- (Q5133141) (← links)
- On bilevel minimum and bottleneck spanning tree problems (Q5241426) (← links)
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
- Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- A branch-and-cut algorithm for submodular interdiction games (Q6364047) (← links)