Polynomial algorithms in linear programming

Cited in

(only showing first 100 items - show all)

Integer program with bimodular matrix
Objective functions and the complexity of policy design
A relaxed version of Karmarkar's method
A polynomial-time algorithm, based on Newton's method, for linear programming
The diagonalizability of quadratic functions and the arbitrariness of shadow prices
A natural randomization strategy for multicommodity flow and related algorithms
Projection algorithms for linear programming
Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
On the recognition of \(S\)-systems
The ellipsoid algorithm using parallel cuts
k-violation linear programming
Minimum cost multiflows in undirected networks
Interactive decision making: Equivalence of modified formulations
Multiflows and disjoint paths of minimum total cost
The mixed evacuation problem
Simulating cardinal preferences in Boolean games: a proof technique
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Bin packing under linear constraints
A convex programming-based algorithm for mean payoff stochastic games with perfect information
An extension of Chubanov's algorithm to symmetric cones
FPT-algorithms for some problems related to integer programming
A utility theory based interactive approach to robustness in linear optimization
Optimization with additional variables and constraints
Reasoning within fuzzy OWL 2 EL revisited
Largest \(j\)-simplices in \(n\)-polytopes
A subexponential bound for linear programming
Minimum constellation covers: hardness, approximability and polynomial cases
Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
Fuzzy linear programming problems: models and solutions
On lattice point counting in -modular polyhedra
Optimal multi-unit mechanisms with private demands
Shortest paths and convex hulls in 2D complexes with non-positive curvature
The problem of identifying the model of substitution of production factors
A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
Computing Walrasian equilibria: fast algorithms and structural properties
FPT-algorithm for computing the width of a simplex given by a convex hull
The computational complexity of three graph problems for instances with bounded minors of constraint matrices
A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
Pivoting in linear complementarity: Two polynomial-time cases
Robust scheduling with budgeted uncertainty
Detecting matrices of combinatorial rank three
On the frontiers of polynomial computations in tropical geometry
An exterior-point method for linear programming problems
A tool for deciding the satisfiability of continuous-time metric temporal logic
Removing algorithmic discrimination (with minimal individual error)
Joint robust optimization of bed capacity, nurse staffing, and care access under uncertainty
Polynomial-time data reduction for weighted problems beyond additive goal functions
Quantifying dynamical total coherence in a resource non-increasing framework
Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
The mixed evacuation problem
Circumscribed ellipsoid algorithm for fixed-point problems
Interior-point methods for linear programming: a review
On integer programming with bounded determinants
The width and integer optimization on simplices with bounded minors of the constraint matrices
Min Sum Edge Coloring in Multigraphs Via Configuration LP
Optimal priorities in GI|Gn|1 queue
Lower bounds for a subexponential optimization algorithm
Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
SOS is not obviously automatizable, even approximately
Improving a primal–dual simplex-type algorithm using interior point methods
Techniques of linear programming based on the theory of convex cones
“More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem
scientific article; zbMATH DE number 7370561 (Why is no real title available?)
A Survey on Analog Models of Computation
On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
The gap function: evaluating integer programming models over multiple right-hand sides
On the complexity of stable fractional hypergraph matching
Distributionally Robust Linear and Discrete Optimization with Marginals
From duels to battlefields: computing equilibria of Blotto and other games
An approach to characterize graded entailment of arguments through a label-based framework
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point
Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
The complexity of some graph problems with bounded minors of their constraint matrices
Complexity, exactness, and rationality in polynomial optimization
Relaxations of mixed integer sets from lattice-free polyhedra
Complexity, exactness, and rationality in polynomial optimization
An exponential lower bound for Zadeh's pivot rule
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Unified representation of the classical ellipsoid method
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
Randomized strategies for robust combinatorial optimization with approximate separation
On -modular integer linear problems in the canonical form and equivalent problems
Learning lyapunov functions for hybrid systems
Shortest path and maximum flow problems in networks with additive losses and gains
A copositive framework for analysis of hybrid Ising-classical algorithms
Minimizing convex functions with rational minimizers
On the identity and group problems for complex Heisenberg matrices
Cutting planes width and the complexity of graph isomorphism refutations
Quadratic convex-concave minimax optimization
Non-negative sparse recovery at minimal sampling rate
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)