Pages that link to "Item:Q1002101"

The following pages link to A fixed parameter algorithm for optimal convex partitions (Q1002101):

Displaying 11 items.

• A decision procedure for optimal polyhedron partitioning (Q794166) (← links)
• Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
• An algorithm to maximize the agreement between partitions (Q1203100) (← links)
• A simplified convergence proof for the cone partitioning algorithm (Q1281480) (← links)
• Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
• A note on the value in the disjoint convex partition problem (Q1991778) (← links)
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
• Partition-Optimization with Schur Convex Sum Objective Functions (Q5317566) (← links)
• A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem (Q5449757) (← links)
• Minimum convex partition of a constrained point set (Q5929323) (← links)