The following pages link to (Q4801573):
Displaying 29 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← 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)
- Round robin tournaments and three index assignments (Q633482) (← links)
- Three-index linear programs with nested structure (Q664295) (← links)
- Facets of the axial three-index assignment polytope (Q908296) (← 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)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Solving the multidimensional assignment problem by a cross-entropy method (Q2015813) (← links)
- Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces (Q2033155) (← links)
- Combining solutions of the axial assignment problem (Q2052595) (← links)
- Heuristic strategies for combining solutions of the three-index axial assignment problem (Q2069670) (← 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)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- Angle Optimization in Target Tracking (Q3512448) (← links)
- Random multi-index matching problems (Q4968882) (← links)
- Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems (Q5084524) (← links)
- A Simple Counterexample to the Monge Ansatz in Multimarginal Optimal Transport, Convex Geometry of the Set of Kantorovich Plans, and the Frenkel--Kontorova Model (Q5243245) (← links)
