Understanding and using linear programming
From MaRDI portal
Publication:852298
DOI10.1007/978-3-540-30717-4zbMATH Open1133.90001OpenAlexW287611495MaRDI QIDQ852298FDOQ852298
Publication date: 28 November 2006
Published in: Universitext (Search for Journal in Brave)
Full work available at URL: http://cds.cern.ch/record/1639324
Recommendations
- scientific article; zbMATH DE number 195106
- scientific article; zbMATH DE number 1823659
- scientific article; zbMATH DE number 757651
- scientific article; zbMATH DE number 1168999
- scientific article; zbMATH DE number 3854804
- scientific article
- scientific article; zbMATH DE number 1260455
- scientific article
- Linear programming
- scientific article; zbMATH DE number 1786124
Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (43)
- Equilibria for games with combined qualitative and quantitative objectives
- Obtaining splits from cut sets of tight spans
- Nested convex bodies are chaseable
- On Representer Theorems and Convex Regularization
- Fast and succinct population protocols for Presburger arithmetic
- A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma
- Separators in Continuous Petri Nets
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Discrete and metric divisorial gonality can be different
- A characterization of the existence of succinct linear representation of subset-valuations
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
- Absolute Lipschitz extendability and linear projection constants
- Security games on matroids
- Formation of a nontrivial finite-time stable attractor in a class of polyhedral sweeping processes with periodic input
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
- Matrix sparsification and the sparse null space problem
- An Epigraphical Approach to the Representer Theorem
- Positive Plücker tree certificates for non-realizability
- Classes of linear programs solvable by coordinate-wise minimization
- A branch and bound method solving the max–min linear discriminant analysis problem
- Drawing from an urn is isometric
- Possibilities determine the combinatorial structure of probability polytopes
- Numerical conformal bootstrap with analytic functionals and outer approximation
- Sparse minimax portfolio and Sharpe ratio models
- Approximating high-dimensional dynamics by barycentric coordinates with linear programming
- Covering grids with multiplicity
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Two-dimensional translation-invariant probability distributions: approximations, characterizations and no-go theorems
- On the realisability of double-cross matrices by polylines in the plane
- Polynomial convolutions in max-plus algebra
- Combinatorial micro-macro dynamical systems
- The \textsc{Exact Subset MultiCover} problem
- Random Projections for Linear Programming
- Near-perfect clique-factors in sparse pseudorandom graphs
- A polynomial-time fragment of epistemic probabilistic argumentation
- Title not available (Why is that?)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Homological filling functions with coefficients
- Intersecting families of permutations
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
- Hitting a path: a generalization of weighted connectivity via game theory
- Granular approximations: a novel statistical learning approach for handling data inconsistency with respect to a fuzzy relation
This page was built for publication: Understanding and using linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852298)
