Pages that link to "Item:Q3204045"
From MaRDI portal
The following pages link to Simple Local Search Problems that are Hard to Solve (Q3204045):
Displaying 16 items.
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
- COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE (Q5408357) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
- (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
- Generalized graph \(k\)-coloring games (Q5918905) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic (Q6110177) (← links)
- Topological distance games (Q6118301) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q6162056) (← links)
- Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy (Q6164505) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)
- Stability based on single-agent deviations in additively separable hedonic games (Q6592981) (← links)
- Partitioning problems via random processes (Q6658754) (← links)
