Pages that link to "Item:Q1318276"

The following pages link to Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking (Q1318276):

Displaying 38 items.

• Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
• Multi-index transportation problems with 1-nested structure (Q510278) (← links)
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
• Three-index linear programs with nested structure (Q664295) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
• Implicit-Runge-Kutta-based methods for fast, precise, and scalable uncertainty propagation (Q891171) (← links)
• Random assignment problems (Q953417) (← links)
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• An LP-based algorithm for the data association problem in multitarget tracking. (Q1423449) (← links)
• Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem (Q1759247) (← links)
• Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (Q1771051) (← links)
• Tracking elementary particles near their primary vertex: A combinatorial approach (Q1817318) (← links)
• Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
• Rank-1 tensor approximation for high-order association in multi-target tracking (Q2193819) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• A bi-criteria approach for the data association problem (Q2379873) (← links)
• Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
• Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem (Q2458107) (← links)
• Some assignment problems arising from multiple target tracking (Q2473184) (← links)
• On multi-index assignment polytopes (Q2494661) (← links)
• Branch and bound solution of the multidimensional assignment problem formulation of data association (Q2905350) (← links)
• Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces (Q3176425) (← links)
• Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem (Q3439531) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• Random multi-index matching problems (Q4968882) (← links)
• Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems (Q5084524) (← links)
• (Q5228454) (← links)
• (Q5228669) (← links)
• Computational Studies of Randomized Multidimensional Assignment Problems (Q5326891) (← links)
• Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem (Q5413067) (← links)
• Group target tracking via jointly optimizing group partition and association (Q6110274) (← links)
• Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem (Q6200618) (← links)