Pages that link to "Item:Q1190599"

The following pages link to New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599):

Displaying 39 items.

• Fair matchings and related problems (Q270032) (← links)
• An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
• An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
• A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
• A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
• The container transshipment problem: searching representation landscapes with metaheuristic algorithms (Q864926) (← links)
• Incremental assignment problem (Q865928) (← links)
• Computing the throughput of concatenation state machines (Q954952) (← links)
• A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
• Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
• Computing maximum mean cuts (Q1329796) (← links)
• The complexity of mean payoff games on graphs (Q1351468) (← links)
• A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
• Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• An algorithm for fractional assignment problems (Q1842662) (← links)
• Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
• A dual approximation approach to weighted matroid intersection (Q1919181) (← links)
• Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
• Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
• The assignment problem revisited (Q2136890) (← links)
• Approximating the minimum cycle mean (Q2253203) (← links)
• The maximum ratio clique problem (Q2356159) (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
• Scheduling unit-length jobs with machine eligibility restrictions (Q2503099) (← links)
• Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
• On covering by translates of a set (Q3068760) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• The quickest flow problem (Q4031968) (← links)
• Understanding retiming through maximum average-delay cycles (Q4277377) (← links)
• A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory (Q5097012) (← links)
• On a matching distance between rooted phylogenetic trees (Q5396440) (← links)
• (Q5743486) (← links)
• A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
• On maximum ratio clique relaxations (Q6085884) (← links)
• Directed shortest paths via approximate cost balancing (Q6567263) (← links)