Pages that link to "Item:Q1366299"
From MaRDI portal
The following pages link to A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems (Q1366299):
Displaying 13 items.
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- ROML: a robust feature correspondence approach for matching objects in a set of images (Q1800046) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← 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)
- Branch and bound algorithms for the multidimensional assignment problem (Q5312759) (← links)
