Pages that link to "Item:Q1186583"
From MaRDI portal
The following pages link to Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583):
Displaying 9 items.
- On the performance guarantee of neural networks for NP-hard optimization problems (Q672967) (← links)
- On the power of neural networks for solving hard problems (Q909457) (← links)
- Neural networks as systems for recognizing patterns (Q1270539) (← links)
- Design rules for application specific dynamical systems (Q1348553) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- A neural network system for solving an assortment problem in the steel industry (Q1897392) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)