Pages that link to "Item:Q1079110"

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

Displaying 50 items.

• 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)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
• A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
• Envy-free matchings with lower quotas (Q1986955) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
• Substitution-based equipment balancing in service networks with multiple equipment types (Q2116916) (← links)
• Matchings under distance constraints. I (Q2241576) (← links)
• Shared processor scheduling of multiprocessor jobs (Q2282535) (← links)
• A priority based assignment problem (Q2293428) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• Approximation algorithms for the maximum carpool matching problem (Q2399375) (← links)
• Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
• A dynamic programming algorithm for the \(k\)-haplotyping problem (Q2431961) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Covering partially directed graphs with directed paths (Q2497477) (← links)
• Approximating and computing behavioural distances in probabilistic transition systems (Q2503333) (← links)
• A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas (Q2976150) (← links)
• (Q3142820) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
• Finding Minimum-Cost Circulations by Successive Approximation (Q3351112) (← links)
• (Q3384766) (← links)
• Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
• Finding minimum-cost circulations by canceling negative cycles (Q3474897) (← links)
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports (Q3478272) (← links)
• Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
• Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
• A primal-dual algorithm for the minimum average weighted length circuit problem (Q3984276) (← links)
• A gradient driven transportation algorithm (Q4009729) (← links)
• A strongly polynomial algorithm for a new class of linear inequalities¹ (Q4836755) (← links)
• Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
• (Q4972740) (← links)
• (Q5002847) (← links)
• Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
• (Q5088931) (← links)
• (Q5111621) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
• (Q5136288) (← links)
• (Q5136330) (← links)
• Robust partial inverse network flow problems (Q5943384) (← links)
• A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)