The following pages link to (Q5519710):
Displaying 50 items.
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Generic properties and control of linear structured systems: A survey (Q1398387) (← links)
- Motion tracking as a constrained optimization problem. (Q1400498) (← links)
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
- Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Analysis of ground state in random bipartite matching (Q1619038) (← links)
- Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets (Q1619310) (← links)
- A coupled ETAS-\(\mathrm{I}^{2}\)GMM point process with applications to seismic fault detection (Q1621039) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Cluster-based sparse topical coding for topic mining and document clustering (Q1630875) (← links)
- Signal classification with a point process distance on the space of persistence diagrams (Q1630882) (← links)
- Local contrast as an effective means to robust clustering against varying densities (Q1631815) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution (Q1651272) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Quality assurance laboratory planning system to maximize worker preference subject to certification and preference balance constraints (Q1652302) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Measuring distributional asymmetry with Wasserstein distance and Rademacher symmetrization (Q1657945) (← links)
- An algorithm for solving an overdetermined tropical linear system using the analysis of stable solutions of subsystems (Q1661496) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- Matching based ground-truth annotation for online handwritten mathematical expressions (Q1677202) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
- Interactive graph-matching using active query strategies (Q1678689) (← links)
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Optimization methods for the train unit shunting problem (Q1683138) (← links)
- The study of group scheduling problems with general dual-position-based job processing times (Q1689067) (← links)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail (Q1691943) (← links)
- Auction dynamics: a volume constrained MBO scheme (Q1700735) (← links)
- On coupling particle filter trajectories (Q1702025) (← links)
- Linear programming based time lag identification in event sequences (Q1716564) (← links)
- A new adaptive Hungarian mating scheme in genetic algorithms (Q1726046) (← links)
- A marriage matching mechanism menagerie (Q1727951) (← links)
- The unit acquisition number of a graph (Q1732112) (← links)
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (Q1736730) (← links)
- The capacitated mobile facility location problem (Q1737488) (← links)
- Mallows and generalized Mallows model for matchings (Q1740522) (← links)
- The PRIMPING routine -- tiling through proximal alternating linearized minimization (Q1741169) (← links)
- Unsupervised group matching with application to cross-lingual topic matching without alignment information (Q1741302) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- Single-machine scheduling with supporting tasks (Q1751119) (← links)
- Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
