Pages that link to "Item:Q1764754"
From MaRDI portal
The following pages link to New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754):
Displaying 11 items.
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
- Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems (Q2371985) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- On the finite-time dynamics of ant colony optimization (Q2433257) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- New branch-and-bound algorithms for k-cardinality tree problems (Q2840678) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
