Pages that link to "Item:Q1327216"

The following pages link to Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216):

Displaying 25 items.

• Metrics and barycenters for point pattern data (Q89375) (← links)
• Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
• Establishing motion correspondence using extended temporal scope (Q814453) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
• Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
• Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
• A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
• Combining solutions of the axial assignment problem (Q2052595) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
• Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
• On multi-index assignment polytopes (Q2494661) (← links)
• On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality (Q2748380) (← links)
• Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem (Q3439531) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)
• Repeated Randomization and Matching in Multi‐Arm Trials (Q5408015) (← links)
• Rerandomization and optimal matching (Q6059481) (← links)
• Criteria convolutions when combining the solutions of the multicriteria axial assignment problem (Q6646031) (← links)