Pages that link to "Item:Q1373741"

The following pages link to A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741):

Displaying 33 items.

• Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
• A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A least-squares minimum-cost network flow algorithm (Q646641) (← links)
• An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
• A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
• A note on a generalized network flow model for manufacturing process (Q1036893) (← links)
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
• Solving the moving target search problem using indistinguishable searchers (Q1711443) (← links)
• A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
• Scheduling in-house transport vehicles to feed parts to automotive assembly lines (Q1753431) (← links)
• EMDUniFrac: exact linear time computation of the UniFrac metric and identification of differentially abundant organisms (Q1784414) (← links)
• The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots (Q1866978) (← links)
• A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
• Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (Q2014365) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• One-dimensional service networks and batch service queues (Q2052950) (← links)
• A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
• Balanced-flow algorithm for path network planning in hierarchical spaces (Q2283024) (← links)
• Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
• An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
• Optimal Distributed Searching in the Plane with and Without Uncertainty (Q2803811) (← links)
• Quadratically Regularized Optimal Transport on Graphs (Q3174762) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
• 3/4-Discrete Optimal Transport (Q3303986) (← links)
• (Q5009421) (← links)
• (Q5111641) (← links)
• Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
• Budget-feasible mechanisms for proportionally selecting agents from groups (Q6080647) (← links)
• Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)