Pages that link to "Item:Q3911685"

The following pages link to A new algorithm for the assignment problem (Q3911685):

Displaying 50 items.

• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• Computing expectations and marginal likelihoods for permutations (Q782657) (← links)
• Towards auction algorithms for large dense assignment problems (Q839685) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• The auction algorithm for the transportation problem (Q918416) (← links)
• Repulsive assignment problem (Q963661) (← links)
• The assignment problem under categorized jobs (Q1054638) (← links)
• Improving the Hungarian assignment algorithm (Q1085073) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
• Primal-dual algorithms for the assignment problem (Q1095790) (← links)
• Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
• Resource constrained assignment problems (Q1264090) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• The invisible hand algorithm: solving the assignment problem with statistical physics (Q1338267) (← links)
• Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
• Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
• A comparison of two algorithms for the assignment problem (Q1804373) (← links)
• Polynomial auction algorithms for shortest paths (Q1804574) (← links)
• Bottleneck assignment problems under categorization (Q1821678) (← links)
• The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
• Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
• Stronger instruments via integer programming in an observational study of late preterm birth outcomes (Q1951518) (← 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 time-triggered dimension reduction algorithm for the task assignment problem (Q2095343) (← links)
• Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
• Matching methods for observational studies derived from large administrative databases (Q2218053) (← links)
• Optimal transport: discretization and algorithms (Q2235779) (← links)
• Empirical optimal transport on countable metric spaces: distributional limits and statistical applications (Q2286450) (← links)
• A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
• Bilevel biobjective pseudo Boolean programming problems (Q2392546) (← links)
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
• Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes (Q2912364) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• Geometric Metrics for Topological Representations (Q3300548) (← links)
• 3/4-Discrete Optimal Transport (Q3303986) (← links)
• Structured transfer function matrices and integer matrices: the computation of the generic McMillan degree and infinite zero structure (Q3542902) (← links)
• A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
• Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
• An in-core/out-of-core method for solving large scale assignment problems (Q3763916) (← links)
• Contrasting Evidence Within and Between Institutions That Provide Treatment in an Observational Study of Alternate Forms of Anesthesia (Q4648533) (← links)
• Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery (Q4904713) (← links)
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
• On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
• Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces (Q6126806) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
• A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)