Pages that link to "Item:Q1085784"

The following pages link to A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784):

Displaying 50 items.

• Comparison and Bayesian Estimation of Feature Allocations (Q79670) (← links)
• Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem (Q331982) (← links)
• An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic (Q336426) (← links)
• Matching samples of multiple views (Q408655) (← links)
• On the Hamming distance in combinatorial optimization problems on hypergraph matchings (Q601985) (← links)
• On scheduling a single machine with resource dependent release times (Q609825) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Efficient index reduction algorithm for large scale systems of differential algebraic equations (Q671058) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] (Q732917) (← links)
• On dual solutions of the linear assignment problem (Q761971) (← links)
• Towards auction algorithms for large dense assignment problems (Q839685) (← links)
• The auction algorithm for the transportation problem (Q918416) (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
• Minimizing total flow time on a single flexible machine (Q988776) (← links)
• Improving the Hungarian assignment algorithm (Q1085073) (← links)
• Primal-dual algorithms for the assignment problem (Q1095790) (← 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)
• Statistical shape analysis of simplified neuronal trees (Q1620982) (← links)
• Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
• Improving bipartite graph edit distance approximation using various search strategies (Q1678686) (← links)
• Topology-aware strategy for MPI-IO operations in clusters (Q1722874) (← links)
• 2CoBel: a scalable belief function representation for 2D discernment frames (Q1726302) (← links)
• Mallows and generalized Mallows model for matchings (Q1740522) (← links)
• A ranked linear assignment approach to Bayesian classification (Q1763274) (← links)
• Weakly paired multimodal fusion using multilayer extreme learning machine (Q1797942) (← 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)
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
• Random assignment problems on \(2d\) manifolds (Q2034668) (← links)
• A dual approach to multi-dimensional assignment problems (Q2052387) (← links)
• Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
• Robust spotter scheduling in trailer yards (Q2215562) (← links)