Helly-type theorems and generalized linear programming
From MaRDI portal
Recommendations
- Generalized convexity and mathematical programs
- scientific article; zbMATH DE number 1263283
- A general class of greedily solvable linear programs
- Generic well posedness in linear programming
- Generalized duality and the geometry of linear programming
- Generalized Convexity in Nonlinear Programming
- Some generalization of inexact linear programming
- On generalised convex mathematical programming
- Generalized linear complementarity problems
- Generalized Linear Complementarity Problems
Cites work
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- scientific article; zbMATH DE number 3770461 (Why is no real title available?)
- scientific article; zbMATH DE number 742949 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- A combinatorial bound for linear programming and related problems
- A subexponential bound for linear programming
- Algorithms for high dimensional stabbing problems
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
- Checking robust nonsingularity is NP-hard
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On Components in Some Families of Sets
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On the ball spanned by balls
- Proof of Grünbaum's conjecture on common transversals for translates
- Systems of linear interval equations
- The Componentwise Distance to the Nearest Singular Matrix
Cited in
(25)- Helly-type theorems for approximate covering
- A quantitative Doignon-Bell-Scarf theorem
- Random sampling in computational algebra: Helly numbers and violator spaces
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Helly numbers of acyclic families
- Violator spaces: Structure and algorithms
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
- On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
- Average case analysis of dynamic geometric optimization
- Helly-type problems
- A subexponential bound for linear programming
- Random sampling with removal
- On geometric optimization with few violated constraints
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Bounding Helly numbers via Betti numbers
- Distance problems within Helly graphs and \(k\)-Helly graphs
- Helly’s theorem: New variations and applications
- Helly-type theorems for homothets of planar convex curves
- No dimension-independent core-sets for containment under homothetics
- On the planar piecewise quadratic 1-center problem
- Approximation of convex figures by pairs of rectangles
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Discrete and lexicographic Helly-type theorems
- Some discrete properties of the space of line transversals to disjoint balls
- Removing degeneracy may require unbounded dimension increase
This page was built for publication: Helly-type theorems and generalized linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338955)
