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