Pages that link to "Item:Q3474493"

The following pages link to A class of bounded approximation algorithms for graph partitioning (Q3474493):

Displaying 23 items.

• Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
• A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
• Approximation algorithms for maximum dispersion (Q1375119) (← links)
• Generating irregular partitionable data structures (Q1575237) (← links)
• Approximating the maximum quadratic assignment problem (Q1607075) (← links)
• Solution of large weighted equicut problems (Q1609912) (← links)
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
• Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
• Tabu search for graph partitioning (Q1919841) (← links)
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) (← links)
• NP-hardness of \(m\)-dimensional weighted matching problems (Q2166755) (← links)
• Balanced partitions of trees and applications (Q2346962) (← links)
• Balanced tree partition problems with virtual nodes (Q2424724) (← links)
• A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem (Q2672118) (← links)
• Truthful Mechanisms for Matching and Clustering in an Ordinal World (Q2959835) (← links)
• On using learning automata for fast graph partitioning (Q5096351) (← links)
• Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search (Q5863640) (← links)
• The balanced maximally diverse grouping problem with attribute values (Q6046134) (← links)
• The balanced maximally diverse grouping problem with integer attribute values (Q6166203) (← links)
• Efficient neighborhood evaluation for the maximally diverse grouping problem (Q6644387) (← links)