Pages that link to "Item:Q3315270"
From MaRDI portal
The following pages link to Towards a Genuinely Polynomial Algorithm for Linear Programming (Q3315270):
Displaying 27 items.
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Is binary encoding appropriate for the problem-language relationship? (Q1163860) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Locating service centers with precedence constraints (Q1314338) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Polynomial algorithms for linear programming over the algebraic numbers (Q1343466) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- The complexity of resource allocation and price mechanisms under bounded rationality (Q1896683) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Low-rank matrix approximation in the infinity norm (Q2273885) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Detecting matrices of combinatorial rank three (Q2452428) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (Q4836755) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- On genuinely time bounded computations (Q5096139) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
