Pages that link to "Item:Q3255799"
From MaRDI portal
The following pages link to Algorithms for the Assignment and Transportation Problems (Q3255799):
Displayed 50 items.
- On the added value of bootstrap analysis for \(K\)-means clustering (Q269548) (← links)
- Minimum cost input/output design for large-scale linear structural systems (Q274009) (← links)
- Prioritizing replenishments of the piece picking area (Q299855) (← links)
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) (← links)
- A clustering ensemble framework based on elite selection of weighted clusters (Q354184) (← links)
- A grid-based approach to formation reconfiguration for a class of robots with non-holonomic constraints (Q389789) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← 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)
- Fast algorithms for placing large entries along the diagonal of a sparse matrix (Q708297) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Fréchet means for distributions of persistence diagrams (Q742821) (← links)
- Incremental assignment problem (Q865928) (← links)
- Maximum travelling salesman problem. I (Q891481) (← links)
- Distribution functions, extremal limits and optimal transport (Q898076) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- A case of non-convergent dual changes in assignment problems (Q1063519) (← links)
- A geometrical interpretation of the Hungarian method (Q1245144) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions (Q2260920) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- Probabilistic Fréchet means for time varying persistence diagrams (Q2346527) (← links)
- Inventory-based dispatching of automated guided vehicles on container terminals (Q2432092) (← links)
- Optimal relay assignment and power allocation for cooperative communications (Q2434579) (← links)
- The graph matching problem (Q2444585) (← links)
- Multiframe many-many point correspondence for vehicle tracking in high density wide area aerial videos (Q2450383) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- Algorithms in unnormalized arithmetic. III: Matrix inversion (Q2535918) (← links)
- The optimal tenement allocation for reducing traffic burden (Q2630839) (← links)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668) (← links)
- Jacobi's bound for a diffiety defined by a quasi-regular system (Q2643115) (← links)
- 3D model comparison using spatial structure circular descriptor (Q2654302) (← links)
- Multilevel Ensemble Transform Particle Filtering (Q2805012) (← links)
- Combining Spot and Futures Markets: A Hybrid Market Approach to Dynamic Spectrum Access (Q2830759) (← links)
- Ellipse Constraints for Improved Wide-Baseline Feature Matching and Reconstruction (Q3003533) (← links)
- A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm (Q3048271) (← links)
- A Fast ℒ<sub><i>p</i></sub> Spike Alignment Metric (Q3057228) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- A contribution to quadratic assignment problems (Q3362092) (← links)
- Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks (Q3459668) (← links)
- ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES (Q3565423) (← links)
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS (Q3602237) (← links)
- Efficient Suboptimal Graph Isomorphism (Q3637695) (← links)
- Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure (Q3687699) (← links)
- Duale transportoptimierung (Q3750520) (← links)