Pages that link to "Item:Q1861927"

The following pages link to An application of tabu search heuristic for the maximum edge-weighted subgraph problem (Q1861927):

Displaying 16 items.

• Breakout local search for maximum clique problems (Q339563) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• Exploring the constrained maximum edge-weight connected graph problem (Q1048254) (← links)
• Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
• Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP (Q4356654) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)