Pages that link to "Item:Q1885977"
From MaRDI portal
The following pages link to Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977):
Displaying 17 items.
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- (Q3369027) (← links)
- Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS (Q4921890) (← links)
- Less is more: Simplified Nelder-Mead method for large unconstrained optimization (Q4987781) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
