Pages that link to "Item:Q1085784"
From MaRDI portal
The following pages link to A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784):
Displayed 39 items.
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking (Q1318276) (← links)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- Kronecker product graph matching. (Q1400491) (← links)
- Motion tracking as a constrained optimization problem. (Q1400498) (← links)
- A note on the assignment problem with seniority and job priority constraints. (Q1420440) (← links)
- Linear assignment procedures (Q1610146) (← links)
- A ranked linear assignment approach to Bayesian classification (Q1763274) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Speeding up the Hungarian algorithm (Q1823856) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- An efficient heuristic for the expansion problem of cellular wireless networks (Q1885950) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Point of presence design in internet protocol networks with performance guarantees (Q2387306) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
- Some assignment problems arising from multiple target tracking (Q2473184) (← links)
- Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies (Q2476755) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Linear and semi-assignment problems: A core oriented approach (Q2563894) (← links)
- Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem (Q2571186) (← links)
- Solving differential-algebraic equations by Taylor series. I: Computing Taylor coefficients (Q2583159) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- Numerical resolution of an “unbalanced” mass transport problem (Q4442061) (← links)
- AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS (Q4675892) (← links)
- New Rollout Algorithms for Combinatorial Optimization Problems (Q4709749) (← links)
- ENHANCED HIERARCHICAL SHAPE MATCHING FOR SHAPE TRANSFORMATION (Q4819332) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
- Hybrid symbiotic genetic optimisation for robust edge-based stereo correspondence (Q5953137) (← links)