Pages that link to "Item:Q6070408"
From MaRDI portal
The following pages link to Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408):
Displaying 5 items.
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information (Q6091866) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
