Combinatorial redundancy detection

DOI10.1007/s10479-016-2385-zzbMath1392.90077OpenAlexW1776614738MaRDI QIDQ1657399

Bernd Gärtner, Komei Fukuda, May Szedlák

Publication date: 13 August 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5143/

zbMATH Keywords

linear programmingsystem of linear inequalitiesoutput sensitive algorithmClarkson methodredundancy removal

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• A finite crisscross method for oriented matroids
• A finite conformal-elimination free algorithm over oriented matroid programming
• Criss-cross methods: A fresh view on pivot algorithms
• Output-sensitive results on convex hulls, extreme points, and related problems
• A subexponential bound for linear programming
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Enumerating extreme points in higher dimensions
• Combinatorial Redundancy Detection
• The maximum numbers of faces of a convex polytope

This page was built for publication: Combinatorial redundancy detection