Pages that link to "Item:Q3030579"
From MaRDI portal
The following pages link to A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs (Q3030579):
Displayed 50 items.
- A dual version of Tardos's algorithm for linear programming (Q581226) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Inverse center location problem on a tree (Q732826) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- Bounded isotonic median regression (Q804181) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube (Q910210) (← links)
- Bilevel time minimizing transportation problem (Q955331) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- A fully polynomial time projective method (Q1104857) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- Note on inverse problem with \(l_\infty\) objective function (Q1272735) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← 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)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Inverse matroid intersection problem (Q1362679) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Inverse optimization in high-speed networks (Q1399112) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- On the algorithmic inversion of the discrete Radon transform (Q1603700) (← links)
- Two level hierarchical time minimizing transportation problem (Q1769948) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Optimization with additional variables and constraints (Q1779712) (← links)