Pages that link to "Item:Q4775712"
From MaRDI portal
The following pages link to A bad network problem for the simplex method and other minimum cost flow algorithms (Q4775712):
Displaying 47 items.
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Approximating earliest arrival flows with flow-dependent transit times (Q867858) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
- Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- Efficient search for rationals (Q1259410) (← links)
- A method for convex curve approximation (Q1278603) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
- Algorithms for flows over time with scheduling costs (Q2118123) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- An Introduction to Network Flows over Time (Q2971621) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)
- Complexity of some parametric integer and network programming problems (Q3712126) (← links)
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056) (← links)
- Parametric maximal flows in generalized networks – complexity and algorithms (Q3813580) (← links)
- Algorithms for flows with parametric capacities (Q3823390) (← links)
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334) (← links)
- The quickest flow problem (Q4031968) (← links)
- A network simplex method (Q4123079) (← links)
- Some experiments with the pathological linear programs of N. Zadeh (Q4170524) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- The complexity of linear programming (Q5904560) (← links)
- Algorithms (Q5905704) (← links)
