Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824): Difference between revisions

@@ Property / DOI @@
-.1007/s10589-019-00114-9
@@ Property / DOI: 10.1007/s10589-019-00114-9 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Unimodularity Test
@@ Property / describes a project that uses: Unimodularity Test / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SCIP
@@ Property / describes a project that uses: SCIP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PDCO
@@ Property / describes a project that uses: PDCO / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Unimodularity
@@ Property / describes a project that uses: Unimodularity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-019-00114-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2950978955
@@ Property / OpenAlex ID: W2950978955 / rank @@
+Normal rank
@@ Property / cites work @@
+Full spark frames
@@ Property / cites work: Full spark frames / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Computational experience with general cutting planes for the set covering problem
+Normal rank
@@ Property / cites work @@
+Permuting Sparse Rectangular Matrices into Block-Diagonal Form
+Normal rank
@@ Property / cites work @@
+Cutting planes from conditional bounds: A new approach to set covering
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+Canonical Cuts on the Unit Hypercube
@@ Property / cites work: Canonical Cuts on the Unit Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+Enhancing an algorithm for set covering problems
@@ Property / cites work: Enhancing an algorithm for set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to compute a sparse basis of the null space
+Normal rank
@@ Property / cites work @@
+Recovering an optimal LP basis from an interior point solution
+Normal rank
@@ Property / cites work @@
+Q4313087
@@ Property / cites work: Q4313087 / rank @@
+Normal rank
@@ Property / cites work @@
+Decoding by Linear Programming
@@ Property / cites work: Decoding by Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the set covering problem
@@ Property / cites work: Algorithms for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchical algorithm for making sparse matrices sparser
+Normal rank
@@ Property / cites work @@
+Atomic Decomposition by Basis Pursuit
@@ Property / cites work: Atomic Decomposition by Basis Pursuit / rank @@
+Normal rank
@@ Property / cites work @@
+Vandermonde matrices, NP-completeness and transversal subspaces
+Normal rank
@@ Property / cites work @@
+On the (co)girth of a connected matroid
@@ Property / cites work: On the (co)girth of a connected matroid / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems
+Normal rank
@@ Property / cites work @@
+Q3096150
@@ Property / cites work: Q3096150 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing the nullspace property using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A Direct Formulation for Sparse PCA Using Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Deterministic constructions of compressed sensing matrices
+Normal rank
@@ Property / cites work @@
+LDPC Codes for Compressed Sensing
@@ Property / cites work: LDPC Codes for Compressed Sensing / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed sensing
@@ Property / cites work: Compressed sensing / rank @@
+Normal rank
@@ Property / cites work @@
+Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ             <sup>1</sup>             minimization
+Normal rank
@@ Property / cites work @@
+Sparsification of rectangular matrices
@@ Property / cites work: Sparsification of rectangular matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse and Redundant Representations
@@ Property / cites work: Sparse and Redundant Representations / rank @@
+Normal rank
@@ Property / cites work @@
+A mathematical introduction to compressive sensing
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a Sparse Basis for the Null Space
@@ Property / cites work: Computing a Sparse Basis for the Null Space / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix sparsification and the sparse null space problem
+Normal rank
@@ Property / cites work @@
+Sparse representations in unions of bases
@@ Property / cites work: Sparse representations in unions of bases / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic graph theory without orientation
@@ Property / cites work: Algebraic graph theory without orientation / rank @@
+Normal rank
@@ Property / cites work @@
+On the minors of an incidence matrix and Smith normal form
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
+Normal rank
@@ Property / cites work @@
+Q3683420
@@ Property / cites work: Q3683420 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Matroid Property Algorithms
@@ Property / cites work: Complexity of Matroid Property Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
+Normal rank
@@ Property / cites work @@
+On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Enumeration Problems for Matroids
+Normal rank
@@ Property / cites work @@
+Hidden Cliques and the Certification of the Restricted Isometry Property
+Normal rank
@@ Property / cites work @@
+Tensor Decompositions and Applications
@@ Property / cites work: Tensor Decompositions and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
+Normal rank
@@ Property / cites work @@
+Sparse recovery with integrality constraints
@@ Property / cites work: Sparse recovery with integrality constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimum weight of linear codes
@@ Property / cites work: Algorithms for the minimum weight of linear codes / rank @@
+Normal rank
@@ Property / cites work @@
+Making sparse matrices sparser: Computational results
+Normal rank
@@ Property / cites work @@
+Finding the circuits of a matroid
@@ Property / cites work: Finding the circuits of a matroid / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of determining a shortest cycle of even length
+Normal rank
@@ Property / cites work @@
+Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
+Normal rank
@@ Property / cites work @@
+Q5390304
@@ Property / cites work: Q5390304 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of matroid properties
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Decomposition of regular matroids
@@ Property / cites work: Decomposition of regular matroids / rank @@
+Normal rank
@@ Property / cites work @@
+A note on hyperplane generation
@@ Property / cites work: A note on hyperplane generation / rank @@
+Normal rank
@@ Property / cites work @@
+A Separation Algorithm for Improved LP-Decoding of Linear Block Codes
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
+Normal rank
@@ Property / cites work @@
+A decomposition theory for matroids. V: Testing of matrix total unimodularity
+Normal rank
@@ Property / cites work @@
+The intractability of computing the minimum distance of a code
+Normal rank
@@ Property / cites work @@
+Implementation of a unimodularity test
@@ Property / cites work: Implementation of a unimodularity test / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Analysis and Applications
@@ Property / cites work: Matrix Analysis and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit
+Normal rank
@@ Property / DOI @@
+.1007/S10589-019-00114-9
@@ Property / DOI: 10.1007/S10589-019-00114-9 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2007824