The following pages link to (Q5519710):
Displayed 50 items.
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- A solution of the affine quadratic inverse eigenvalue problem (Q630522) (← links)
- Mapping workflow applications with types on heterogeneous specialized platforms (Q645854) (← links)
- Optimal assignment of resources to strengthen the weakest link in an uncertain environment (Q646646) (← links)
- Characterizing complex particle morphologies through shape matching: descriptors, applications, and algorithms (Q654968) (← links)
- Quadratic nonnegative matrix factorization (Q663378) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- On dual solutions of the linear assignment problem (Q761971) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Establishing motion correspondence using extended temporal scope (Q814453) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Solving house allocation problems with risk-averse agents (Q836964) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bilevel time minimizing assignment problem (Q865542) (← links)
- Incremental assignment problem (Q865928) (← links)
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
- A general approach to the measurement of change in fuzzy concept lattices (Q889995) (← links)
- Globally optimal joint image segmentation and shape matching based on Wasserstein modes (Q890098) (← links)
- Evolutionary dynamics and equitable core selection in assignment games (Q891334) (← links)
- Maximum travelling salesman problem. I (Q891481) (← links)
- Optimal Sokoban solving using pattern databases with specific domain knowledge (Q899157) (← links)
- Spatio-temporal multi-robot routing (Q900215) (← links)
- Defect detection using feature point matching for non-repetitive patterned images (Q903103) (← links)
- Graph matching by simplified convex-concave relaxation procedure (Q903552) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Goal programming in the context of the assignment problem and a computationally effective solution method (Q929411) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Random assignment problems (Q953417) (← links)
- On voting-based consensus of cluster ensembles (Q962785) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- The multi-shift vehicle routing problem with overtime (Q976019) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)