Pages that link to "Item:Q1079110"

The following pages link to A strongly polynomial minimum cost circulation algorithm (Q1079110):

Displaying 50 items.

• Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
• About the minimum mean cycle-canceling algorithm (Q499347) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications (Q678869) (← links)
• Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• Bilevel time minimizing assignment problem (Q865542) (← links)
• Relaxation methods for monotropic programs (Q909583) (← links)
• Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
• A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
• George Dantzig's impact on the theory of computation (Q951091) (← links)
• Bilevel time minimizing transportation problem (Q955331) (← links)
• An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
• An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
• A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
• Subspaces with well-scaled frames (Q1122483) (← links)
• Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
• The minimal average cost flow problem (Q1130071) (← links)
• A network penalty method (Q1174423) (← links)
• Color constrained combinatorial optimization problems (Q1178732) (← links)
• Finding minimum-cost flows by double scaling (Q1184348) (← links)
• On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
• New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Inverse problem of minimum cuts (Q1298756) (← links)
• On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
• Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479) (← links)
• Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• Minimum cost multiflows in undirected networks (Q1337137) (← links)
• A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
• Inverse matroid intersection problem (Q1362679) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
• Inverse problems of submodular functions on digraphs (Q1573989) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
• A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
• Two level hierarchical time minimizing transportation problem (Q1769948) (← links)
• A primal-simplex based Tardos' algorithm (Q1785451) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• An algorithm for fractional assignment problems (Q1842662) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)