Enumeration of PLCP-orientations of the 4-cube
From MaRDI portal
Publication:491752
DOI10.1016/j.ejc.2015.03.010zbMath1319.05014arXiv1309.7225OpenAlexW2063037623MaRDI QIDQ491752
Publication date: 19 August 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7225
Exact enumeration problems, generating functions (05A15) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items
A Mihalisin-Klee theorem for fans, Realizability makes a difference: a complexity gap for sink-finding in USOs, On the Holt-Klee property for oriented matroid programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Combinatorial characterizations of \(K\)-matrices
- Unique sink orientations of grids
- NP-completeness of the linear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Generation of oriented matroids --- a graph theoretical approach
- On the generation of oriented matroids
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- Complete enumeration of small realizable oriented matroids
- Higher Bruhat orders and cyclic hyperplane arrangements
- Pivoting in linear complementarity: Two polynomial-time cases
- Counting unique-sink orientations
- Complementary pivot theory of mathematical programming
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Complementarity in Oriented Matroids
- Linear programming and unique sink orientations
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Linear complementarity problems solvable by A single linear program
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
- LP-orientations of cubes and crosspolytopes
- Oriented Matroids
- Equilibrium Points of Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- A Probelm in Linear Inequalities
- A Partition Theorem for Euclidean n-Space
