The following pages link to Assignment Problems (Q3531417):
Displaying 50 items.
- On the identifiability of Bayesian factor analytic models (Q113012) (← links)
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals (Q136014) (← links)
- The focus of attention problem (Q262243) (← links)
- Discrete optimal transport: complexity, geometry and applications (Q262303) (← links)
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Linearizable special cases of the QAP (Q266060) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- The partitioning min-max weighted matching problem (Q320079) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
- An eigensystem approach to Anderson localization (Q329626) (← links)
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- Optimal bounds for integrals with respect to copulas and applications (Q398667) (← links)
- Improved particle filters for multi-target tracking (Q418990) (← links)
- Assignment markets that are uniquely determined by their core (Q421564) (← links)
- Some properties of Gromov-Hausdorff distances (Q452012) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Probabilistic model validation for uncertain nonlinear systems (Q466275) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331) (← links)
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition (Q521649) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- On scheduling a single machine with resource dependent release times (Q609825) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Tropical determinant of integer doubly-stochastic matrices (Q665944) (← links)
- The Wiener maximum quadratic assignment problem (Q665991) (← links)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Bounds on integrals with respect to multivariate copulas (Q727659) (← links)
- Distribution functions, extremal limits and optimal transport (Q898076) (← links)
- Spatio-temporal multi-robot routing (Q900215) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Optimizing the marriage market: an application of the linear assignment model (Q1039809) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- Computational aspects of assigning agents to a line (Q1680103) (← links)
