The following pages link to (Q5519710):
Displaying 50 items.
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Two-sided allocation problems, decomposability, and the impossibility of efficient trade (Q1757552) (← links)
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems (Q1761253) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Solving the aerial fleet refueling problem using group theoretic tabu search (Q1767071) (← links)
- Solving a combinatorial problem with network flows (Q1767398) (← links)
- Complexity results for flow-shop problems with a single server (Q1772843) (← links)
- An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (Q1785430) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
- ROML: a robust feature correspondence approach for matching objects in a set of images (Q1800046) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- A labeling algorithm to solve the assignment problem (Q1823140) (← links)
- Speeding up the Hungarian algorithm (Q1823856) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
- Fiber-to-object assignment heuristics (Q1847144) (← links)
- Optimal matching problem in detection and recognition performance evaluation (Q1860170) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- A new pivoting strategy for Gaussian elimination (Q1915612) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- A tale of three eras: the discovery and rediscovery of the Hungarian method (Q1926686) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions (Q1933544) (← links)
- An algorithm for identifying fair and optimal allocations (Q1934132) (← links)
- Recognizing interactive group activities using temporal interaction matrices and their Riemannian statistics (Q1943421) (← links)
- Preferences and the price of stability in matching markets (Q1945450) (← links)
- Molecular alignment as a penalized permutation Procrustes problem (Q1945542) (← links)
- A linear assignment approach for the least-squares protein morphing problem (Q1960195) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A two-stage solution approach for the directed rural postman problem with turn penalties (Q1991193) (← links)
- Distributionally robust scheduling on parallel machines under moment uncertainty (Q1991203) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration (Q2028763) (← links)
- A decomposition-based heuristic procedure for the medical student scheduling problem (Q2028840) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- The balanced maximally diverse grouping problem with block constraints (Q2031070) (← links)
- A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer (Q2031754) (← links)
- Random assignment problems on \(2d\) manifolds (Q2034668) (← links)
- A quotient space formulation for generative statistical analysis of graphical data (Q2036213) (← links)
- Comparing high-dimensional partitions with the Co-clustering adjusted rand index (Q2040033) (← links)
- Reliability-based fuzzy clustering ensemble (Q2048768) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
- One-dimensional service networks and batch service queues (Q2052950) (← links)
- Algorithms for fair \(k\)-clustering with multiple protected attributes (Q2060384) (← links)
- Complexity of linear minimization and projection on some sets (Q2060605) (← links)
