Pages that link to "Item:Q852298"
From MaRDI portal
The following pages link to Understanding and using linear programming (Q852298):
Displaying 41 items.
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Possibilities determine the combinatorial structure of probability polytopes (Q334459) (← links)
- Security games on matroids (Q507326) (← links)
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane (Q745667) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- Homological filling functions with coefficients (Q2102721) (← links)
- Discrete and metric divisorial gonality can be different (Q2120835) (← links)
- Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
- Sparse minimax portfolio and Sharpe ratio models (Q2165774) (← links)
- Combinatorial micro-macro dynamical systems (Q2180100) (← links)
- A polynomial-time fragment of epistemic probabilistic argumentation (Q2302822) (← links)
- Polynomial convolutions in max-plus algebra (Q2321368) (← links)
- On the realisability of double-cross matrices by polylines in the plane (Q2396825) (← links)
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases (Q2411265) (← links)
- Hitting a path: a generalization of weighted connectivity via game theory (Q2424795) (← links)
- Obtaining splits from cut sets of tight spans (Q2446320) (← links)
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems (Q2813334) (← links)
- Approximating high-dimensional dynamics by barycentric coordinates with linear programming (Q2821598) (← links)
- Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems (Q4626109) (← links)
- An Epigraphical Approach to the Representer Theorem (Q5026403) (← links)
- Absolute Lipschitz extendability and linear projection constants (Q5074054) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- On Representer Theorems and Convex Regularization (Q5231664) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
- Intersecting families of permutations (Q5892593) (← links)
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)
- A branch and bound method solving the max–min linear discriminant analysis problem (Q6078428) (← links)
- Granular approximations: a novel statistical learning approach for handling data inconsistency with respect to a fuzzy relation (Q6127117) (← links)
- Trajectory following dynamic programming algorithms without finite support assumptions (Q6137271) (← links)
- Fast and succinct population protocols for Presburger arithmetic (Q6142599) (← links)
- Separators in Continuous Petri Nets (Q6151564) (← links)
- A characterization of the existence of succinct linear representation of subset-valuations (Q6167805) (← links)
- Formation of a nontrivial finite-time stable attractor in a class of polyhedral sweeping processes with periodic input (Q6186396) (← links)
- Covering grids with multiplicity (Q6204684) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)
- Drawing from an urn is isometric (Q6629453) (← links)
- Numerical conformal bootstrap with analytic functionals and outer approximation (Q6633774) (← links)
- The \textsc{Exact Subset MultiCover} problem (Q6652461) (← links)
