Pages that link to "Item:Q953319"
From MaRDI portal
The following pages link to Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319):
Displaying 10 items.
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem (Q1861927) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
- (Q3369027) (← links)