Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
From MaRDI portal
Publication:6173941
DOI10.1007/s10878-023-01054-1zbMath1530.90055arXiv2212.04268OpenAlexW4380881465MaRDI QIDQ6173941
Publication date: 13 July 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.04268
integer programmingsparse optimizationnon-negative partial \(s\)-goodnessweighted linear programming
Cites Work
- Unnamed Item
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
- Total unimodularity and combinatorial theorems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Total dual integrality and integral solutions of the linear complementarity problem
- Partial \(S\)-goodness for partially sparse signal recovery
- Integer Solution for Linear Complementarity Problem
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Outline of an algorithm for integer solutions to linear programs
- Mixed Integer Programming Computation
- Sparse Optimization Theory and Methods
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- A strongly polynomial algorithm for bimodular integer linear programming
- A tree-search algorithm for mixed integer programming problems
This page was built for publication: Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
