Pages that link to "Item:Q1278259"

The following pages link to Geometric three-dimensional assignment problems (Q1278259):

Displaying 15 items.

• The focus of attention problem (Q262243) (← links)
• The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
• Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
• The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
• Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
• Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
• On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065) (← links)
• Combining solutions of the axial assignment problem (Q2052595) (← links)
• On a property of a three-dimensional matrix (Q2249936) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem (Q3439531) (← links)
• Angle Optimization in Target Tracking (Q3512448) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)