Combinatorial redundancy detection
type: Item
instance of: scholarly article
title: Combinatorial redundancy detection
zbMATH Open document ID: 1392.90077
author: Komei Fukuda
author: B. Gärtner
author: May Szedlák
published in: Annals of Operations Research
publication date: 2018-08-13T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5143/
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6916966
zbMATH Keywords: system of linear inequalities
zbMATH Keywords: redundancy removal
zbMATH Keywords: linear programming
zbMATH Keywords: output sensitive algorithm
zbMATH Keywords: Clarkson method
MaRDI profile type: Publication
OpenAlex ID: W1776614738
cites work: Q4003411
cites work: Output-sensitive results on convex hulls, extreme points, and related problems
cites work: Q4079613
cites work: A subexponential bound for linear programming
cites work: Q3844775
cites work: An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
cites work: LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
cites work: Combinatorial Redundancy Detection
cites work: A finite conformal-elimination free algorithm over oriented matroid programming
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: Q4051879
cites work: The maximum numbers of faces of a convex polytope
cites work: Enumerating extreme points in higher dimensions
cites work: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
cites work: Q3818127
cites work: A finite crisscross method for oriented matroids
DOI: 10.1007/S10479-016-2385-Z
description: scientific article; zbMATH DE number 6916966