Pages that link to "Item:Q5549535"
From MaRDI portal
The following pages link to Letter to the Editor—The Multidimensional Assignment Problem (Q5549535):
Displaying 50 items.
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies (Q139209) (← links)
- A MIP model for scheduling India's general elections and police movement (Q260654) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- Asymptotic properties of random multidimensional assignment problems (Q819336) (← links)
- Symmetry breaking constraints for value symmetries in constraint satisfaction (Q850460) (← 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)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Random assignment problems (Q953417) (← links)
- New lower bounds for the triplanar assignment problem. Use of the classical model (Q1003082) (← 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)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- Time-cost tradeoff in a three-dimensional assignment problem (Q1123126) (← links)
- The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- A variation of the assignment problem (Q1309926) (← links)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
- The three-dimensional bottleneck assignment problem with capacity constraints (Q1328651) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
- An LP-based algorithm for the data association problem in multitarget tracking. (Q1423449) (← links)
- Efficient sensor network management for asset localization (Q1654358) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Linear-time separation algorithms for the three-index assignment polytope (Q1801663) (← links)
- Scheduling sports competitions on multiple venues. (Q1810517) (← links)
- Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
- Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
- Multidimensional assignment problem for multipartite entity resolution (Q2079699) (← links)
- On a property of a three-dimensional matrix (Q2249936) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- Data-driven combinatorial optimization for sensor-based assessment of near falls (Q2329894) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem (Q2458107) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- Branch and bound solution of the multidimensional assignment problem formulation of data association (Q2905350) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces (Q3176425) (← links)
