Polynomial algorithms in linear programming

Cited in

(only showing first 100 items - show all)

Quantifying dynamical total coherence in a resource non-increasing framework
Two design principles of geometric algorithms in finite-precision arithmetic
A copositive framework for analysis of hybrid Ising-classical algorithms
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
On the efficiency of algebraic simplex algorithms for solving MDPs
Polynomial-time data reduction for weighted problems beyond additive goal functions
Circumscribed ellipsoid algorithm for fixed-point problems
SOS is not obviously automatizable, even approximately
A unified worst case for classical simplex and policy iteration pivot rules
Algorithms for minimizing the movements of spreading points in linear domains
An approach to characterize graded entailment of arguments through a label-based framework
Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
Interior-point methods for linear programming: a review
Shortest paths and convex hulls in 2D complexes with non-positive curvature
The problem of identifying the model of substitution of production factors
FMplex: a novel method for solving linear real arithmetic problems
Optimal priorities in GI|Gn|1 queue
Bin packing under linear constraints
The computational complexity of three graph problems for instances with bounded minors of constraint matrices
An extension of Chubanov's algorithm to symmetric cones
The \(p\)-hub center allocation problem
Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
Projection algorithms for linear programming
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Lower bounds for a subexponential optimization algorithm
Robust vertex enumeration for convex hulls in high dimensions
On the frontiers of polynomial computations in tropical geometry
Objective functions and the complexity of policy design
Matching with transfers under distributional constraints
Minimizing convex functions with rational minimizers
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Probabilistic temporal reasoning using superposition semantics
The complexity of some graph problems with bounded minors of their constraint matrices
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
Techniques of linear programming based on the theory of convex cones
On the complexity of stable fractional hypergraph matching
Pivoting in linear complementarity: Two polynomial-time cases
Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
FMplex: exploring a bridge between Fourier-Motzkin and simplex
Primal separation and approximation for the \(\{0,1/2\}\)-closure
On the optimal mixing problem of approximate Nash equilibria in bimatrix games
A Survey on Analog Models of Computation
On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
An exterior-point method for linear programming problems
A polynomial-time algorithm, based on Newton's method, for linear programming
Optimal multi-unit mechanisms with private demands
Computing Walrasian equilibria: fast algorithms and structural properties
A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
Complexity, exactness, and rationality in polynomial optimization
Complexity, exactness, and rationality in polynomial optimization
Recognizing one-dimensional Euclidean preference profiles
The mixed evacuation problem
The mixed evacuation problem
FPT-algorithms for some problems related to integer programming
A utility theory based interactive approach to robustness in linear optimization
A natural randomization strategy for multicommodity flow and related algorithms
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
The ellipsoid method and computational aspects
Distributionally Robust Linear and Discrete Optimization with Marginals
Fuzzy linear programming problems: models and solutions
Min Sum Edge Coloring in Multigraphs Via Configuration LP
Minimum constellation covers: hardness, approximability and polynomial cases
scientific article; zbMATH DE number 7370561 (Why is no real title available?)
The gap function: evaluating integer programming models over multiple right-hand sides
Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
On the complexity of convex and reverse convex prequadratic constraints
On the optimal mixing problem of approximate Nash equilibria in bimatrix games
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
Largest \(j\)-simplices in \(n\)-polytopes
k-violation linear programming
On integer programming with bounded determinants
The width and integer optimization on simplices with bounded minors of the constraint matrices
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
On the recognition of \(S\)-systems
Improving a primal–dual simplex-type algorithm using interior point methods
The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
Computational complexity of norm-maximization
From duels to battlefields: computing equilibria of Blotto and other games
Randomized strategies for robust combinatorial optimization with approximate separation
Unified representation of the classical ellipsoid method
Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
Optimization with additional variables and constraints
Unique sink orientations of grids
The ellipsoid algorithm using parallel cuts
On lattice point counting in -modular polyhedra
On the identity and group problems for complex Heisenberg matrices
Shortest path and maximum flow problems in networks with additive losses and gains
A subexponential bound for linear programming
A tool for deciding the satisfiability of continuous-time metric temporal logic
An exponential lower bound for Zadeh's pivot rule
Quadratic convex-concave minimax optimization
Integer program with bimodular matrix
FPT-algorithm for computing the width of a simplex given by a convex hull
Non-negative sparse recovery at minimal sampling rate
Reasoning within fuzzy OWL 2 EL revisited
Detecting matrices of combinatorial rank three
New formulation for coloring circle graphs

This page was built for publication: Polynomial algorithms in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910301)