Pages that link to "Item:Q139206"

The following pages link to Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206):

Displaying 35 items.

• Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies (Q139209) (← links)
• approxmatch (Q139210) (← links)
• The focus of attention problem (Q262243) (← links)
• The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
• Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
• Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
• Three-index linear programs with nested structure (Q664295) (← links)
• A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
• The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← 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)
• Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
• Geometric three-dimensional assignment problems (Q1278259) (← links)
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
• Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
• Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
• Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
• Scheduling sports competitions on multiple venues. (Q1810517) (← links)
• Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
• Scheduling jobs of equal length: Complexity, facets and computational results (Q1919094) (← links)
• Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
• Combining solutions of the axial assignment problem (Q2052595) (← links)
• Heuristic strategies for combining solutions of the three-index axial assignment problem (Q2069670) (← links)
• On a property of a three-dimensional matrix (Q2249936) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• A heuristic method for solving integer-valued decompositional multiindex problems (Q2261778) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← links)
• Branch and bound solution of the multidimensional assignment problem formulation of data association (Q2905350) (← links)
• Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem (Q5095157) (← links)
• Approximate search for known gene clusters in new genomes using PQ-trees (Q6487618) (← links)