The following pages link to (Q3145800):
Displaying 41 items.
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals (Q136014) (← links)
- Prioritizing replenishments of the piece picking area (Q299855) (← links)
- An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
- Some properties of Gromov-Hausdorff distances (Q452012) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
- Optimal assignment of resources to strengthen the weakest link in an uncertain environment (Q646646) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
- Random assignment problems (Q953417) (← links)
- The computational complexity of bilevel assignment problems (Q976987) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Experiments concerning sequential versus simultaneous maximization of objective function and distance (Q1009194) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Fast Fourier transform for fitness landscapes (Q1604498) (← links)
- Allocation under a general substitution structure (Q1737487) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Max-algebra: The linear algebra of combinatorics? (Q1873718) (← links)
- Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
- Multidimensional assignment problem for multipartite entity resolution (Q2079699) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
- Uncertain random assignment problem (Q2295196) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- On the job rotation problem (Q2467127) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
- Co‐ordination and control of distributed spacecraft systems using convex optimization techniques (Q4532968) (← links)
- Dynamic discrete tomography (Q4634750) (← links)
- Optimal Bipartite Network Clustering (Q4969080) (← links)
- Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies (Q5066745) (← links)
- Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem (Q6200378) (← links)
- Linear Programming on the Stiefel Manifold (Q6202765) (← links)
