Pages that link to "Item:Q1402543"
From MaRDI portal
The following pages link to Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543):
Displaying 6 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- How to guarantee finite termination of verifying global optimization codes (Q1300086) (← links)
- An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
- On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models (Q4545686) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)