scientific article; zbMATH DE number 1894374
From MaRDI portal
Recommendations
Cited in
(33)- Round robin tournaments and three index assignments
- A simple counterexample to the Monge ansatz in multimarginal optimal transport, convex geometry of the set of Kantorovich plans, and the Frenkel-Kontorova model
- Clique facets of the axial and planar assignment polytopes
- The constant objective value property for multidimensional assignment problems
- Integer programming models for the multidimensional assignment problem with star costs
- Fast separation for the three-index assignment problem
- Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Facets of the axial three-index assignment polytope
- Combining solutions of the axial assignment problem
- Test problem generator for the multidimensional assignment problem
- Multi-dimensional vector assignment problems
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- Random multi-index matching problems
- Heuristic strategies for combining solutions of the three-index axial assignment problem
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Multiindex transportation problems with 2-embedded structure
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Three-index linear programs with nested structure
- Angle Optimization in Target Tracking
- Mixed-integer programming approaches for index tracking and enhanced indexation
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- Resolvability of multi-index axial assignment problem on one-cyclic substitutions
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- Nonlinear assignment problems. Algorithms and applications
- Local search heuristics for the multidimensional assignment problem
- On multi-index assignment polytopes
- Graph partitions for the multidimensional assignment problem
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Solving the multidimensional assignment problem by a cross-entropy method
- A heuristic method for solving integer-valued decompositional multiindex problems
- Multi-index transport problems with decomposition structure
- Local search heuristics for multi-index assignment problems with decomposable costs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801573)
