Computing the spark: mixed-integer programming for the (vector) matroid girth problem

We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational optimization and applications Ročník 74; číslo 2; s. 387 - 441
Hlavní autor: Tillmann, Andreas M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2019
Springer Nature B.V
Témata:
Algorithms
Computation
Convex and Discrete Geometry
Integer programming
Linear programming
Management Science
Mathematical programming
Mathematics
Mathematics and Statistics
Matrices (mathematics)
Operations Research
Operations Research/Decision Theory
Optimization
Signal reconstruction
Solvers
Statistics
Matroid girth
90C10
94A15
05B35
90C57
Mixed-integer programming
68Q17
90C11
Sparse recovery
Spark
Branch-and-cut
Compressed sensing
ISSN:0926-6003, 1573-2894
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures, and propose several exact (mixed-)integer programming models and linear programming heuristics. In particular, we develop a branch and cut scheme to determine the girth of a matroid, focussing on the vector matroid case, for which the girth is precisely the spark of the representation matrix. Extensive numerical experiments demonstrate the effectiveness of our specialized algorithms compared to general-purpose black-box solvers applied to several mixed-integer programming models.
AbstractList We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures, and propose several exact (mixed-)integer programming models and linear programming heuristics. In particular, we develop a branch and cut scheme to determine the girth of a matroid, focussing on the vector matroid case, for which the girth is precisely the spark of the representation matrix. Extensive numerical experiments demonstrate the effectiveness of our specialized algorithms compared to general-purpose black-box solvers applied to several mixed-integer programming models.
Author Tillmann, Andreas M.
Author_xml – sequence: 1
  givenname: Andreas M.
  orcidid: 0000-0002-7744-836X
  surname: Tillmann
  fullname: Tillmann, Andreas M.
  email: andreas.tillmann@cs.rwth-aachen.de
  organization: Visual Computing Institute and Chair of Operations Research, RWTH Aachen University
BookMark eNp9kE1PwyAYgImZiXP6Bzw18aIH9IW2tHgzi1_JEi_uTGihHXMtFZjRfy9bTUw8jAS4PA8veU7RpLe9RuiCwA0BKG49gbzkGEjcQEiG-RGakrxIMS15NkFT4JRhBpCeoFPv1wDAi5RO0XJuu2EbTN8mYaUTP0j3fpd05ksrbPqgW-2SwdnWya7bQY11e_DqU9fBuuukk8FZo5LWuLDaodVGd2fouJEbr89_7xlaPj68zZ_x4vXpZX6_wHVKeMCSZzLLKc0pb5gqgaqSqDKrqyZXBAooGeNaASkrxutG0bgkq1iesYaopmbpDF2O78a5H1vtg1jbrevjSEFpyrMsnmmkypGqnfXe6UbUJshgbB-cNBtBQOwiijGiiBHFPqLgUaX_1MGZTrrvw1I6Sj7CfSz496sD1g9_EIYg
CitedBy_id crossref_primary_10_1016_j_acha_2025_101786
crossref_primary_10_1007_s10489_022_04144_5
crossref_primary_10_1007_s10589_020_00235_6
crossref_primary_10_1007_s43670_023_00053_x
crossref_primary_10_1109_TIT_2022_3159100
crossref_primary_10_1137_21M142770X
Cites_doi 10.1007/BF01582278
10.1137/0211014
10.1109/TIT.2013.2290112
10.1016/0095-8956(90)90030-4
10.1016/0024-3795(94)90407-3
10.1017/9781108277587
10.1016/j.orl.2008.09.009
10.1137/S1064827502401953
10.1137/S0895480103428338
10.1109/LSP.2014.2345761
10.1109/TASE.2010.2089449
10.1016/0024-3795(77)90069-6
10.1017/CBO9780511803888
10.1007/s10208-002-0076-4
10.1109/TIT.2012.2191697
10.1007/s10107-010-0416-0
10.1016/j.dam.2007.06.015
10.1006/jsco.1998.0204
10.1137/050645506
10.1016/0024-3795(93)00173-W
10.1186/s13634-018-0535-y
10.1109/TIT.2006.871582
10.1109/18.641542
10.1016/0167-6377(94)90074-4
10.1137/070686676
10.1017/S0305004100056498
10.1109/LSP.2015.2447934
10.1007/BF01389453
10.1109/TIT.2003.820031
10.1007/978-3-642-78240-4
10.1007/s10107-010-0417-z
10.1137/0207033
10.1007/s00041-012-9235-4
10.1109/TSP.2016.2550020
10.1109/78.705428
10.1007/978-1-4419-7011-4
10.1007/BF01588780
10.1016/0377-2217(92)90215-U
10.1007/BF02251238
10.1007/s00453-015-0042-6
10.1007/BF01580890
10.1016/0095-8956(80)90075-1
10.1006/jcss.1997.1472
10.1137/0123007
10.1006/jctb.1994.1033
10.1109/TIT.2011.2181819
10.5121/ijdps.2012.3501
10.1109/TIT.2005.858979
10.1016/B978-0-12-566780-7.50017-9
10.1016/0304-3975(94)00254-G
10.1109/TASE.2013.2259479
10.1137/S1064827596304010
10.1109/TCOMM.2010.04.090164
10.1109/TASE.2013.2271703
10.1016/j.jco.2007.04.002
10.1137/07070111X
10.1016/S0304-3975(97)00115-1
10.1137/0608037
10.6028/jres.080B.034
10.3934/amc.2016.10.195
10.1073/pnas.0437847100
10.1007/s12532-012-0048-x
10.1023/A:1019225027893
10.21236/ADA131387
10.1117/12.2188541
10.1007/978-3-642-36065-7_23
10.1090/amsip/051.2/22
ContentType Journal Article
Copyright Springer Science+Business Media, LLC, part of Springer Nature 2019
Computational Optimization and Applications is a copyright of Springer, (2019). All Rights Reserved.
Copyright_xml – notice: Springer Science+Business Media, LLC, part of Springer Nature 2019
– notice: Computational Optimization and Applications is a copyright of Springer, (2019). All Rights Reserved.
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
L7M
L~C
L~D
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10589-019-00114-9
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList
ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Statistics
Mathematics
EISSN 1573-2894
EndPage 441
ExternalDocumentID 10_1007_s10589_019_00114_9
GroupedDBID -52
-5D
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
28-
29F
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
7WY
88I
8AO
8FE
8FG
8FL
8FW
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHQJS
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EBU
EDO
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9R
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZD
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z7R
Z7S
Z7X
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8R
Z8U
Z8W
Z92
ZL0
ZMTXR
ZWQNP
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c319t-a94a4522529f6d802d81d84cbf5d10708669ed018b69cfd2222a6b6546f1dfc63
IEDL.DBID M2P
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000487544900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0926-6003
IngestDate Wed Nov 26 13:52:18 EST 2025
Sat Nov 29 01:51:29 EST 2025
Tue Nov 18 21:17:14 EST 2025
Fri Feb 21 02:36:45 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Matroid girth
90C10
94A15
05B35
90C57
Mixed-integer programming
68Q17
90C11
Sparse recovery
Spark
Branch-and-cut
Compressed sensing
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-a94a4522529f6d802d81d84cbf5d10708669ed018b69cfd2222a6b6546f1dfc63
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-7744-836X
PQID 2239442233
PQPubID 30811
PageCount 55
ParticipantIDs proquest_journals_2239442233
crossref_citationtrail_10_1007_s10589_019_00114_9
crossref_primary_10_1007_s10589_019_00114_9
springer_journals_10_1007_s10589_019_00114_9
PublicationCentury 2000
PublicationDate 20191100
2019-11-00
20191101
PublicationDateYYYYMMDD 2019-11-01
PublicationDate_xml – month: 11
  year: 2019
  text: 20191100
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle An International Journal
PublicationTitle Computational optimization and applications
PublicationTitleAbbrev Comput Optim Appl
PublicationYear 2019
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Aveila, Boccia, Vasilyev (CR7) 2009; 37
Garey, Johnson (CR41) 1979
Tanatmis, Ruzika, Hamacher, Punekar, Kienle, Wehn (CR81) 2009; 2009
Kruskal (CR63) 1977; 18
Vardy (CR87) 1997; 43
CR38
Arellano, Hicks (CR5) 2014; 11
Ferris, Pataki, Schmieta (CR37) 2001; 66
Chen, Donoho, Saunders (CR22) 1998; 20
Jokar, Pfetsch (CR55) 2008; 31
Bausal, Kianfar, Ding, Moreno-Centeno (CR13) 2013; 10
Schrijver (CR78) 2003
CR70
Kolda, Bader (CR62) 2009; 51
Truemper (CR86) 1990; 49
Dimakis, Smarandache, Vontobel (CR32) 2012; 58
Donoho (CR33) 2006; 52
d’Aspremont, Ghaoui (CR29) 2011; 127
Amaldi, Kann (CR3) 1998; 209
Mitchell, Pardalos, Resende (CR73) 2002
Balas, Ho (CR10) 1980; 12
Jensen, Korte (CR54) 1982; 11
Beasley, Jornsten (CR14) 1992; 58
Oxley (CR76) 2011
CR4
Balas (CR9) 1980; 12
DeVore (CR31) 2007; 23
Foucart, Rauhut (CR39) 2013
Naidu, Jampana, Sastry (CR75) 2016; 64
Gharibi (CR42) 2012; 3
McCormick (CR71) 1990; 49
Tillmann, Gribonval, Pfetsch (CR84) 2014; 2014
Iwen (CR53) 2009; 2009
Gilbert, Heath (CR43) 1987; 8
Grossman, Kulkarni, Schochetman (CR47) 1995; 218
Amaldi, Kann (CR2) 1995; 147
Arora, Babai, Stern, Sweedyk (CR6) 1997; 54
CR40
Caprara, Toth, Fischetti (CR20) 2000; 98
CR82
Minieka (CR72) 1976; 80B
Balas, Ng (CR12) 1989; 43
Seymour (CR79) 1980; 28
Donoho, Elad (CR34) 2003; 100
Chang, McCormick (CR21) 1992; 56
Zhang (CR90) 2017
Alexeev, Cahill, Mixon (CR1) 2012; 18
Grötschel, Lovász, Schrijver (CR48) 1993
Monien (CR74) 1983; 31
CR17
Cho, Chen, Ding (CR24) 2007; 155
Robinson, Welsh (CR77) 1980; 87
Kianfar, Pourhabib, Ding (CR59) 2011; 8
Chistov, Fournier, Gurvits, Koiran (CR23) 2003; 3
Itai, Rodeh (CR52) 1978; 7
Elad (CR36) 2010
Manikas, Proukakis (CR69) 1998; 46
CR50
Berry, Heath, Kaneka, Lawo, Plemmons, Ward (CR15) 1985; 47
Bixby, Saltzman (CR16) 1994; 15
CR91
Egner, Minkwitz (CR35) 1998; 26
Grossman, Kulkarni, Schochetman (CR46) 1994; 212–213
d’Aspremont, Bach, Ghaoui (CR28) 2008; 9
Gottlieb, Neylon (CR44) 2016; 76
Khachiyan, Boros, Elbassioni, Gurvich, Makino (CR58) 2006; 19
Seymour (CR80) 1994; 61
Tillmann, Pfetsch (CR85) 2014; 60
Gribonval, Nielsen (CR45) 2003; 49
Helmling, Ruzika, Tanatmis (CR49) 2012; 58
Tillmann (CR83) 2015; 22
Zhang, Han, Fang (CR89) 2015; 22
Keha, Duman (CR57) 2010; 58
Balas, Jeroslow (CR11) 1972; 23
Hoffman, McCormick, Pulleyblank (CR51) 1984
CR27
CR26
Cho, Mishra, Xu (CR25) 2018; 2018
Candès, Tao (CR19) 2005; 51
CR68
CR67
Aykanat, Pinar, Çatalyürek (CR8) 2004; 25
d’Aspremont, Ghaoui, Jordan, Lanckriet (CR30) 2007; 49
CR64
Lisoněk, Trummer (CR65) 2016; 10
Cameron (CR18) 1994
CR61
CR60
Juditsky, Nemirovski (CR56) 2011; 127
Walter, Truemper (CR88) 2013; 5
Liu, Xia (CR66) 2013; 2013
C Aykanat (114_CR8) 2004; 25
DL Donoho (114_CR33) 2006; 52
P Lisoněk (114_CR65) 2016; 10
A Caprara (114_CR20) 2000; 98
RA DeVore (114_CR31) 2007; 23
S Jokar (114_CR55) 2008; 31
E Balas (114_CR12) 1989; 43
GC Robinson (114_CR77) 1980; 87
A Manikas (114_CR69) 1998; 46
M Grötschel (114_CR48) 1993
114_CR70
M Helmling (114_CR49) 2012; 58
AJ Hoffman (114_CR51) 1984
E Balas (114_CR10) 1980; 12
RE Bixby (114_CR16) 1994; 15
S Egner (114_CR35) 1998; 26
A d’Aspremont (114_CR30) 2007; 49
M Walter (114_CR88) 2013; 5
AG Dimakis (114_CR32) 2012; 58
JE Mitchell (114_CR73) 2002
114_CR38
XD Zhang (114_CR90) 2017
K Kianfar (114_CR59) 2011; 8
A Itai (114_CR52) 1978; 7
L Khachiyan (114_CR58) 2006; 19
ST McCormick (114_CR71) 1990; 49
PJ Cameron (114_CR18) 1994
E Balas (114_CR11) 1972; 23
S Foucart (114_CR39) 2013
A Tanatmis (114_CR81) 2009; 2009
JD Arellano (114_CR5) 2014; 11
DL Donoho (114_CR34) 2003; 100
RR Naidu (114_CR75) 2016; 64
E Balas (114_CR9) 1980; 12
M Cho (114_CR25) 2018; 2018
PM Jensen (114_CR54) 1982; 11
B Monien (114_CR74) 1983; 31
114_CR82
A Juditsky (114_CR56) 2011; 127
114_CR40
J Zhang (114_CR89) 2015; 22
A d’Aspremont (114_CR28) 2008; 9
SS Chen (114_CR22) 1998; 20
AM Tillmann (114_CR85) 2014; 60
E Amaldi (114_CR3) 1998; 209
PD Seymour (114_CR79) 1980; 28
R Gribonval (114_CR45) 2003; 49
A Vardy (114_CR87) 1997; 43
LA Gottlieb (114_CR44) 2016; 76
S Arora (114_CR6) 1997; 54
A Chistov (114_CR23) 2003; 3
E Amaldi (114_CR2) 1995; 147
114_CR4
A d’Aspremont (114_CR29) 2011; 127
JW Grossman (114_CR46) 1994; 212–213
114_CR91
MC Ferris (114_CR37) 2001; 66
114_CR50
E Minieka (114_CR72) 1976; 80B
K Truemper (114_CR86) 1990; 49
JR Gilbert (114_CR43) 1987; 8
E Candès (114_CR19) 2005; 51
MR Garey (114_CR41) 1979
AB Keha (114_CR57) 2010; 58
JB Kruskal (114_CR63) 1977; 18
A Schrijver (114_CR78) 2003
114_CR17
B Alexeev (114_CR1) 2012; 18
JJ Cho (114_CR24) 2007; 155
MW Berry (114_CR15) 1985; 47
MA Iwen (114_CR53) 2009; 2009
P Aveila (114_CR7) 2009; 37
SF Chang (114_CR21) 1992; 56
AM Tillmann (114_CR83) 2015; 22
M Bausal (114_CR13) 2013; 10
AM Tillmann (114_CR84) 2014; 2014
M Elad (114_CR36) 2010
JW Grossman (114_CR47) 1995; 218
W Gharibi (114_CR42) 2012; 3
114_CR61
114_CR60
JG Oxley (114_CR76) 2011
XJ Liu (114_CR66) 2013; 2013
114_CR64
114_CR67
JE Beasley (114_CR14) 1992; 58
114_CR68
PD Seymour (114_CR80) 1994; 61
114_CR27
TG Kolda (114_CR62) 2009; 51
114_CR26
References_xml – ident: CR70
– volume: 43
  start-page: 57
  issue: 1–3
  year: 1989
  end-page: 69
  ident: CR12
  article-title: On the set covering polytope: I. All the facets with coefficients in 0, 1, 2
  publication-title: Math. Program.
  doi: 10.1007/BF01582278
– volume: 11
  start-page: 184
  issue: 1
  year: 1982
  end-page: 190
  ident: CR54
  article-title: Complexity of matroid property algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/0211014
– volume: 60
  start-page: 1248
  issue: 2
  year: 2014
  end-page: 1259
  ident: CR85
  article-title: The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2013.2290112
– volume: 49
  start-page: 241
  year: 1990
  end-page: 281
  ident: CR86
  article-title: A decomposition theory for matroids. V. Testing of matrix total unimodularity
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(90)90030-4
– volume: 212–213
  start-page: 289
  year: 1994
  end-page: 307
  ident: CR46
  article-title: Algebraic graph theory without orientation
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(94)90407-3
– ident: CR68
– year: 2017
  ident: CR90
  publication-title: Matrix Analysis and Applications
  doi: 10.1017/9781108277587
– ident: CR4
– year: 2011
  ident: CR76
  publication-title: Matroid Theory. Oxford Graduate Texts Mathematics
– volume: 37
  start-page: 16
  issue: 1
  year: 2009
  end-page: 20
  ident: CR7
  article-title: Computational experience with general cutting planes for the set covering problem
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2008.09.009
– volume: 25
  start-page: 1860
  issue: 6
  year: 2004
  end-page: 1879
  ident: CR8
  article-title: Permuting sparse rectangular matrices into block-diagonal form
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827502401953
– volume: 19
  start-page: 966
  issue: 4
  year: 2006
  end-page: 984
  ident: CR58
  article-title: On the complexity of some enumeration problems for matroids
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S0895480103428338
– volume: 22
  start-page: 45
  issue: 1
  year: 2015
  end-page: 49
  ident: CR83
  article-title: On the computational intractability of exact and approximate dictionary learning
  publication-title: IEEE Signal Process. Lett.
  doi: 10.1109/LSP.2014.2345761
– volume: 8
  start-page: 447
  issue: 2
  year: 2011
  end-page: 450
  ident: CR59
  article-title: An integer programming approach for analyzing the measurement redundancy in structured linear systems
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2010.2089449
– volume: 18
  start-page: 95
  issue: 2
  year: 1977
  end-page: 138
  ident: CR63
  article-title: Three-way arrays: rank and uniqueness of trilinear decompositions
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(77)90069-6
– ident: CR61
– volume: 2009
  start-page: 870
  year: 2009
  end-page: 875
  ident: CR53
  article-title: Simple deterministically constructible RIP matrices with sublinear Fourier sampling requirements
  publication-title: Proc. CISS
– year: 1994
  ident: CR18
  publication-title: Combinatorics: topics, techniques. Algorithms
  doi: 10.1017/CBO9780511803888
– volume: 3
  start-page: 421
  issue: 4
  year: 2003
  end-page: 427
  ident: CR23
  article-title: Vandermonde matrices, NP-completeness, and transversal subspaces
  publication-title: Found. Comput. Math.
  doi: 10.1007/s10208-002-0076-4
– volume: 58
  start-page: 4753
  issue: 7
  year: 2012
  end-page: 4769
  ident: CR49
  article-title: Mathematical programming decoding of binary linear codes: theory and algorithms
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2012.2191697
– volume: 127
  start-page: 123
  issue: 1
  year: 2011
  end-page: 144
  ident: CR29
  article-title: Testing the nullspace property using semidefinite programming
  publication-title: Math. Program.
  doi: 10.1007/s10107-010-0416-0
– volume: 155
  start-page: 2456
  issue: 18
  year: 2007
  end-page: 2470
  ident: CR24
  article-title: On the (co)girth of a connected matroid
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2007.06.015
– volume: 26
  start-page: 135
  issue: 2
  year: 1998
  end-page: 149
  ident: CR35
  article-title: Sparsification of rectangular matrices
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1998.0204
– volume: 49
  start-page: 434
  issue: 3
  year: 2007
  end-page: 448
  ident: CR30
  article-title: A direct formulation for sparse PCA using semidefinite programming
  publication-title: SIAM Rev.
  doi: 10.1137/050645506
– volume: 218
  start-page: 213
  year: 1995
  end-page: 224
  ident: CR47
  article-title: On the minors of an incidence matrix and its Smith normal form
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(93)00173-W
– volume: 2018
  start-page: 16
  year: 2018
  ident: CR25
  article-title: Computable performance guarantees for compressed sensing matrices
  publication-title: EURASIP J. Adv. Signal Process.
  doi: 10.1186/s13634-018-0535-y
– volume: 52
  start-page: 1289
  issue: 4
  year: 2006
  end-page: 1306
  ident: CR33
  article-title: Compressed sensing
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2006.871582
– ident: CR67
– ident: CR50
– volume: 43
  start-page: 1757
  issue: 6
  year: 1997
  end-page: 1766
  ident: CR87
  article-title: The intractability of computing the minimum distance of a code
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.641542
– volume: 15
  start-page: 169
  issue: 4
  year: 1994
  end-page: 178
  ident: CR16
  article-title: Recovering an optimal LP basis from an interior point solution
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(94)90074-4
– volume: 31
  start-page: 23
  issue: 1
  year: 2008
  end-page: 44
  ident: CR55
  article-title: Exact and approximate sparse solutions of underdetermined linear equations
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/070686676
– volume: 87
  start-page: 29
  issue: 29
  year: 1980
  end-page: 45
  ident: CR77
  article-title: The computational complexity of matroid properties
  publication-title: Math. Proc. Camb. Philos. Soc.
  doi: 10.1017/S0305004100056498
– volume: 22
  start-page: 1960
  issue: 11
  year: 2015
  end-page: 1964
  ident: CR89
  article-title: Deterministic construction of compressed sensing matrices from protograph LDPC codes
  publication-title: IEEE Signal Process. Lett.
  doi: 10.1109/LSP.2015.2447934
– ident: CR60
– volume: 47
  start-page: 483
  issue: 4
  year: 1985
  end-page: 504
  ident: CR15
  article-title: An algorithm to compute a sparse basis of the null space
  publication-title: Numer. Math.
  doi: 10.1007/BF01389453
– volume: 49
  start-page: 3320
  issue: 2
  year: 2003
  end-page: 3325
  ident: CR45
  article-title: Sparse representations in unions of bases
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2003.820031
– year: 1993
  ident: CR48
  publication-title: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics,
  doi: 10.1007/978-3-642-78240-4
– volume: 127
  start-page: 57
  issue: 1
  year: 2011
  end-page: 88
  ident: CR56
  article-title: On verifiable sufficient conditions for sparse signal recovery via minimization
  publication-title: Math. Program.
  doi: 10.1007/s10107-010-0417-z
– volume: 7
  start-page: 413
  issue: 4
  year: 1978
  end-page: 423
  ident: CR52
  article-title: Finding a minimum circuit in a graph
  publication-title: SIAM J. Comput.
  doi: 10.1137/0207033
– volume: 18
  start-page: 1167
  issue: 6
  year: 2012
  end-page: 1194
  ident: CR1
  article-title: Full spark frames
  publication-title: J. Fourier Anal. Appl.
  doi: 10.1007/s00041-012-9235-4
– ident: CR64
– volume: 64
  start-page: 3566
  issue: 14
  year: 2016
  end-page: 3575
  ident: CR75
  article-title: Deterministic compressed sensing matrices: construction via Euler squares and applications
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2550020
– volume: 46
  start-page: 2166
  issue: 8
  year: 1998
  end-page: 2179
  ident: CR69
  article-title: Modeling and estimation of ambiguities in linear arrays
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.705428
– ident: CR26
– year: 2010
  ident: CR36
  publication-title: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing
  doi: 10.1007/978-1-4419-7011-4
– volume: 49
  start-page: 91
  issue: 1–3
  year: 1990
  end-page: 111
  ident: CR71
  article-title: Making sparse matrices sparser: computational results
  publication-title: Math. Program.
  doi: 10.1007/BF01588780
– year: 2003
  ident: CR78
  publication-title: Combinatorial optimization: polyhedra and efficiency, volume A algorithms and combinatorics
– volume: 58
  start-page: 293
  issue: 2
  year: 1992
  end-page: 300
  ident: CR14
  article-title: Enhancing an algorithm for set covering problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(92)90215-U
– volume: 31
  start-page: 355
  issue: 4
  year: 1983
  end-page: 369
  ident: CR74
  article-title: The complexity of determining a shortest cycle of even length
  publication-title: Computing
  doi: 10.1007/BF02251238
– ident: CR91
– volume: 76
  start-page: 426
  issue: 2
  year: 2016
  end-page: 444
  ident: CR44
  article-title: Matrix sparsification and the sparse null space problem
  publication-title: Algorithmica
  doi: 10.1007/s00453-015-0042-6
– volume: 56
  start-page: 1
  issue: 1–3
  year: 1992
  end-page: 30
  ident: CR21
  article-title: A hierarchical algorithm for making sparse matrices sparser
  publication-title: Math. Program.
  doi: 10.1007/BF01580890
– volume: 28
  start-page: 305
  year: 1980
  end-page: 359
  ident: CR79
  article-title: Decomposition of regular matroids
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(80)90075-1
– volume: 54
  start-page: 317
  issue: 2
  year: 1997
  end-page: 331
  ident: CR6
  article-title: The hardness of approximate optima in lattices, codes, and systems of linear equations
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1997.1472
– volume: 23
  start-page: 61
  issue: 1
  year: 1972
  end-page: 69
  ident: CR11
  article-title: Canonical cuts on the unit hypercube
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0123007
– volume: 61
  start-page: 88
  year: 1994
  end-page: 91
  ident: CR80
  article-title: A note on hyperplane generation
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1994.1033
– volume: 58
  start-page: 3093
  issue: 5
  year: 2012
  end-page: 3114
  ident: CR32
  article-title: LDPC codes for compressed sensing
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2011.2181819
– volume: 3
  start-page: 1
  issue: 5
  year: 2012
  end-page: 8
  ident: CR42
  article-title: An improved lower bound of the spark with application
  publication-title: Int. J. Distrib. Parallel Syst.
  doi: 10.5121/ijdps.2012.3501
– volume: 9
  start-page: 1269
  year: 2008
  end-page: 1294
  ident: CR28
  article-title: Optimal solutions for sparse principal component analysis
  publication-title: J. Mach. Learn. Res.
– volume: 2009
  start-page: 2216
  year: 2009
  end-page: 2220
  ident: CR81
  article-title: Valid inequalities for binary linear codes
  publication-title: Proc. ISIT
– ident: CR82
– volume: 51
  start-page: 4203
  issue: 12
  year: 2005
  end-page: 4215
  ident: CR19
  article-title: Decoding by linear programming
  publication-title: IEEE Trans. Inform. Theory
  doi: 10.1109/TIT.2005.858979
– year: 1979
  ident: CR41
  publication-title: Computers and Intractability. A Guide to the Theory of NP-Completeness
– ident: CR40
– ident: CR27
– start-page: 185
  year: 1984
  end-page: 196
  ident: CR51
  article-title: A fast algorithm that makes matrices optimally sparse
  publication-title: Progress in Combinatorial Optimization
  doi: 10.1016/B978-0-12-566780-7.50017-9
– volume: 147
  start-page: 181
  year: 1995
  end-page: 210
  ident: CR2
  article-title: The complexity and approximability of finding maximum feasible subsystems of linear relations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00254-G
– volume: 12
  start-page: 37
  year: 1980
  end-page: 60
  ident: CR10
  article-title: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study
  publication-title: Math. Prog.
– volume: 10
  start-page: 1151
  issue: 4
  year: 2013
  end-page: 1157
  ident: CR13
  article-title: Hybridization of bound-and-decompose and mixed integer feasibility checking to measure redundancy in structured linear systems
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2013.2259479
– volume: 20
  start-page: 33
  issue: 1
  year: 1998
  end-page: 61
  ident: CR22
  article-title: Atomic decomposition by basis pursuit
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827596304010
– volume: 58
  start-page: 1072
  issue: 4
  year: 2010
  end-page: 1079
  ident: CR57
  article-title: Minimum distance computation of LDPC codes using a branch and cut algorithm
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2010.04.090164
– volume: 11
  start-page: 274
  issue: 1
  year: 2014
  end-page: 279
  ident: CR5
  article-title: Degree of redundancy of linear systems using implicit set covering
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2013.2271703
– volume: 12
  start-page: 19
  year: 1980
  end-page: 36
  ident: CR9
  article-title: Cutting planes from conditional bounds: a new approach to set covering
  publication-title: Math. Prog.
– ident: CR38
– volume: 23
  start-page: 918
  issue: 4–6
  year: 2007
  end-page: 925
  ident: CR31
  article-title: Deterministic constructions of compressed sensing matrices
  publication-title: J. Complex.
  doi: 10.1016/j.jco.2007.04.002
– volume: 51
  start-page: 455
  issue: 3
  year: 2009
  end-page: 500
  ident: CR62
  article-title: Tensor decompositions and applications
  publication-title: SIAM Rev.
  doi: 10.1137/07070111X
– ident: CR17
– volume: 2014
  start-page: 7148
  year: 2014
  end-page: 7152
  ident: CR84
  article-title: Projection onto the cosparse set is NP-hard
  publication-title: Proc. ICASSP
– year: 2013
  ident: CR39
  publication-title: A Mathematical Introduction to Compressive Sensing. Applied and Numeric Harmonic Analysis
– volume: 209
  start-page: 237
  issue: 1–2
  year: 1998
  end-page: 260
  ident: CR3
  article-title: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00115-1
– volume: 8
  start-page: 446
  issue: 3
  year: 1987
  end-page: 459
  ident: CR43
  article-title: Computing a sparse basis for the null space
  publication-title: SIAM J. Algebraic Discrete Methods
  doi: 10.1137/0608037
– volume: 80B
  start-page: 337
  issue: 3
  year: 1976
  end-page: 342
  ident: CR72
  article-title: Finding the circuits of a matroid
  publication-title: J. Res. Natl. Bur. Stand. B
  doi: 10.6028/jres.080B.034
– start-page: 65
  year: 2002
  end-page: 77
  ident: CR73
  article-title: Branch-and-cut algorithms for combinatorial optimization problems
  publication-title: Handbook of Applied Optimization
– volume: 10
  start-page: 195
  issue: 1
  year: 2016
  end-page: 207
  ident: CR65
  article-title: Algorithms for the minimum weight of linear codes
  publication-title: Adv. Math. Commun.
  doi: 10.3934/amc.2016.10.195
– volume: 100
  start-page: 2197
  issue: 5
  year: 2003
  end-page: 2202
  ident: CR34
  article-title: Optimally sparse representation in general (non-orthogonal) dictionaries via minimization
  publication-title: Proc. Natl. Acad. Sci. USA
  doi: 10.1073/pnas.0437847100
– volume: 5
  start-page: 57
  issue: 1
  year: 2013
  end-page: 73
  ident: CR88
  article-title: Implementation of a unimodularity test
  publication-title: Math. Program. Comput.
  doi: 10.1007/s12532-012-0048-x
– volume: 2013
  start-page: 479
  year: 2013
  end-page: 483
  ident: CR66
  article-title: Constructions of quasi-cyclic measurement matrices based on array codes
  publication-title: Proc. ISIT
– volume: 98
  start-page: 353
  year: 2000
  end-page: 371
  ident: CR20
  article-title: Algorithms for the set covering problem
  publication-title: Ann. Oper. Res.
  doi: 10.1023/A:1019225027893
– volume: 66
  start-page: 2
  year: 2001
  end-page: 6
  ident: CR37
  article-title: Solving the seymour problem
  publication-title: Optima
– volume: 127
  start-page: 123
  issue: 1
  year: 2011
  ident: 114_CR29
  publication-title: Math. Program.
  doi: 10.1007/s10107-010-0416-0
– start-page: 65
  volume-title: Handbook of Applied Optimization
  year: 2002
  ident: 114_CR73
– volume: 80B
  start-page: 337
  issue: 3
  year: 1976
  ident: 114_CR72
  publication-title: J. Res. Natl. Bur. Stand. B
  doi: 10.6028/jres.080B.034
– volume: 58
  start-page: 3093
  issue: 5
  year: 2012
  ident: 114_CR32
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2011.2181819
– volume: 28
  start-page: 305
  year: 1980
  ident: 114_CR79
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(80)90075-1
– ident: 114_CR61
– volume-title: A Mathematical Introduction to Compressive Sensing. Applied and Numeric Harmonic Analysis
  year: 2013
  ident: 114_CR39
– volume: 31
  start-page: 23
  issue: 1
  year: 2008
  ident: 114_CR55
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/070686676
– volume: 19
  start-page: 966
  issue: 4
  year: 2006
  ident: 114_CR58
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S0895480103428338
– volume: 49
  start-page: 3320
  issue: 2
  year: 2003
  ident: 114_CR45
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2003.820031
– ident: 114_CR4
– volume: 20
  start-page: 33
  issue: 1
  year: 1998
  ident: 114_CR22
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827596304010
– volume: 51
  start-page: 455
  issue: 3
  year: 2009
  ident: 114_CR62
  publication-title: SIAM Rev.
  doi: 10.1137/07070111X
– volume: 100
  start-page: 2197
  issue: 5
  year: 2003
  ident: 114_CR34
  publication-title: Proc. Natl. Acad. Sci. USA
  doi: 10.1073/pnas.0437847100
– ident: 114_CR70
  doi: 10.21236/ADA131387
– volume-title: Computers and Intractability. A Guide to the Theory of NP-Completeness
  year: 1979
  ident: 114_CR41
– volume: 12
  start-page: 19
  year: 1980
  ident: 114_CR9
  publication-title: Math. Prog.
– volume: 43
  start-page: 1757
  issue: 6
  year: 1997
  ident: 114_CR87
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.641542
– volume-title: Matrix Analysis and Applications
  year: 2017
  ident: 114_CR90
  doi: 10.1017/9781108277587
– ident: 114_CR17
– volume-title: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics,
  year: 1993
  ident: 114_CR48
  doi: 10.1007/978-3-642-78240-4
– volume: 26
  start-page: 135
  issue: 2
  year: 1998
  ident: 114_CR35
  publication-title: J. Symb. Comput.
  doi: 10.1006/jsco.1998.0204
– volume: 2018
  start-page: 16
  year: 2018
  ident: 114_CR25
  publication-title: EURASIP J. Adv. Signal Process.
  doi: 10.1186/s13634-018-0535-y
– volume: 212–213
  start-page: 289
  year: 1994
  ident: 114_CR46
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(94)90407-3
– ident: 114_CR64
– volume: 87
  start-page: 29
  issue: 29
  year: 1980
  ident: 114_CR77
  publication-title: Math. Proc. Camb. Philos. Soc.
  doi: 10.1017/S0305004100056498
– volume: 5
  start-page: 57
  issue: 1
  year: 2013
  ident: 114_CR88
  publication-title: Math. Program. Comput.
  doi: 10.1007/s12532-012-0048-x
– volume: 58
  start-page: 293
  issue: 2
  year: 1992
  ident: 114_CR14
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(92)90215-U
– volume: 98
  start-page: 353
  year: 2000
  ident: 114_CR20
  publication-title: Ann. Oper. Res.
  doi: 10.1023/A:1019225027893
– volume: 8
  start-page: 447
  issue: 2
  year: 2011
  ident: 114_CR59
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2010.2089449
– volume: 18
  start-page: 95
  issue: 2
  year: 1977
  ident: 114_CR63
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(77)90069-6
– volume: 31
  start-page: 355
  issue: 4
  year: 1983
  ident: 114_CR74
  publication-title: Computing
  doi: 10.1007/BF02251238
– volume: 22
  start-page: 45
  issue: 1
  year: 2015
  ident: 114_CR83
  publication-title: IEEE Signal Process. Lett.
  doi: 10.1109/LSP.2014.2345761
– ident: 114_CR68
– volume: 49
  start-page: 91
  issue: 1–3
  year: 1990
  ident: 114_CR71
  publication-title: Math. Program.
  doi: 10.1007/BF01588780
– volume: 2013
  start-page: 479
  year: 2013
  ident: 114_CR66
  publication-title: Proc. ISIT
– volume: 22
  start-page: 1960
  issue: 11
  year: 2015
  ident: 114_CR89
  publication-title: IEEE Signal Process. Lett.
  doi: 10.1109/LSP.2015.2447934
– ident: 114_CR26
– volume: 2014
  start-page: 7148
  year: 2014
  ident: 114_CR84
  publication-title: Proc. ICASSP
– volume: 155
  start-page: 2456
  issue: 18
  year: 2007
  ident: 114_CR24
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2007.06.015
– volume: 52
  start-page: 1289
  issue: 4
  year: 2006
  ident: 114_CR33
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2006.871582
– volume: 147
  start-page: 181
  year: 1995
  ident: 114_CR2
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00254-G
– volume: 15
  start-page: 169
  issue: 4
  year: 1994
  ident: 114_CR16
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(94)90074-4
– volume: 46
  start-page: 2166
  issue: 8
  year: 1998
  ident: 114_CR69
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/78.705428
– ident: 114_CR60
  doi: 10.1117/12.2188541
– volume: 209
  start-page: 237
  issue: 1–2
  year: 1998
  ident: 114_CR3
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00115-1
– volume: 218
  start-page: 213
  year: 1995
  ident: 114_CR47
  publication-title: Linear Algebra Appl.
  doi: 10.1016/0024-3795(93)00173-W
– ident: 114_CR50
– volume: 49
  start-page: 434
  issue: 3
  year: 2007
  ident: 114_CR30
  publication-title: SIAM Rev.
  doi: 10.1137/050645506
– volume: 12
  start-page: 37
  year: 1980
  ident: 114_CR10
  publication-title: Math. Prog.
– ident: 114_CR40
– volume-title: Matroid Theory. Oxford Graduate Texts Mathematics
  year: 2011
  ident: 114_CR76
– ident: 114_CR38
– volume: 76
  start-page: 426
  issue: 2
  year: 2016
  ident: 114_CR44
  publication-title: Algorithmica
  doi: 10.1007/s00453-015-0042-6
– ident: 114_CR67
– volume: 49
  start-page: 241
  year: 1990
  ident: 114_CR86
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(90)90030-4
– volume: 2009
  start-page: 2216
  year: 2009
  ident: 114_CR81
  publication-title: Proc. ISIT
– ident: 114_CR82
– volume: 18
  start-page: 1167
  issue: 6
  year: 2012
  ident: 114_CR1
  publication-title: J. Fourier Anal. Appl.
  doi: 10.1007/s00041-012-9235-4
– volume: 47
  start-page: 483
  issue: 4
  year: 1985
  ident: 114_CR15
  publication-title: Numer. Math.
  doi: 10.1007/BF01389453
– volume: 3
  start-page: 1
  issue: 5
  year: 2012
  ident: 114_CR42
  publication-title: Int. J. Distrib. Parallel Syst.
  doi: 10.5121/ijdps.2012.3501
– volume: 61
  start-page: 88
  year: 1994
  ident: 114_CR80
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1006/jctb.1994.1033
– volume: 23
  start-page: 918
  issue: 4–6
  year: 2007
  ident: 114_CR31
  publication-title: J. Complex.
  doi: 10.1016/j.jco.2007.04.002
– volume: 7
  start-page: 413
  issue: 4
  year: 1978
  ident: 114_CR52
  publication-title: SIAM J. Comput.
  doi: 10.1137/0207033
– volume: 127
  start-page: 57
  issue: 1
  year: 2011
  ident: 114_CR56
  publication-title: Math. Program.
  doi: 10.1007/s10107-010-0417-z
– ident: 114_CR27
  doi: 10.1007/978-3-642-36065-7_23
– volume: 10
  start-page: 1151
  issue: 4
  year: 2013
  ident: 114_CR13
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2013.2259479
– volume: 56
  start-page: 1
  issue: 1–3
  year: 1992
  ident: 114_CR21
  publication-title: Math. Program.
  doi: 10.1007/BF01580890
– volume: 25
  start-page: 1860
  issue: 6
  year: 2004
  ident: 114_CR8
  publication-title: SIAM J. Sci. Comput.
  doi: 10.1137/S1064827502401953
– volume-title: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing
  year: 2010
  ident: 114_CR36
  doi: 10.1007/978-1-4419-7011-4
– volume: 58
  start-page: 1072
  issue: 4
  year: 2010
  ident: 114_CR57
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2010.04.090164
– volume: 9
  start-page: 1269
  year: 2008
  ident: 114_CR28
  publication-title: J. Mach. Learn. Res.
– volume-title: Combinatorial optimization: polyhedra and efficiency, volume A algorithms and combinatorics
  year: 2003
  ident: 114_CR78
– volume: 11
  start-page: 184
  issue: 1
  year: 1982
  ident: 114_CR54
  publication-title: SIAM J. Comput.
  doi: 10.1137/0211014
– volume: 10
  start-page: 195
  issue: 1
  year: 2016
  ident: 114_CR65
  publication-title: Adv. Math. Commun.
  doi: 10.3934/amc.2016.10.195
– volume: 43
  start-page: 57
  issue: 1–3
  year: 1989
  ident: 114_CR12
  publication-title: Math. Program.
  doi: 10.1007/BF01582278
– start-page: 185
  volume-title: Progress in Combinatorial Optimization
  year: 1984
  ident: 114_CR51
  doi: 10.1016/B978-0-12-566780-7.50017-9
– volume: 2009
  start-page: 870
  year: 2009
  ident: 114_CR53
  publication-title: Proc. CISS
– ident: 114_CR91
  doi: 10.1090/amsip/051.2/22
– volume: 66
  start-page: 2
  year: 2001
  ident: 114_CR37
  publication-title: Optima
– volume: 37
  start-page: 16
  issue: 1
  year: 2009
  ident: 114_CR7
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2008.09.009
– volume: 11
  start-page: 274
  issue: 1
  year: 2014
  ident: 114_CR5
  publication-title: IEEE Trans. Autom. Sci. Eng.
  doi: 10.1109/TASE.2013.2271703
– volume: 60
  start-page: 1248
  issue: 2
  year: 2014
  ident: 114_CR85
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2013.2290112
– volume: 58
  start-page: 4753
  issue: 7
  year: 2012
  ident: 114_CR49
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2012.2191697
– volume: 3
  start-page: 421
  issue: 4
  year: 2003
  ident: 114_CR23
  publication-title: Found. Comput. Math.
  doi: 10.1007/s10208-002-0076-4
– volume: 54
  start-page: 317
  issue: 2
  year: 1997
  ident: 114_CR6
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1997.1472
– volume: 23
  start-page: 61
  issue: 1
  year: 1972
  ident: 114_CR11
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0123007
– volume-title: Combinatorics: topics, techniques. Algorithms
  year: 1994
  ident: 114_CR18
  doi: 10.1017/CBO9780511803888
– volume: 8
  start-page: 446
  issue: 3
  year: 1987
  ident: 114_CR43
  publication-title: SIAM J. Algebraic Discrete Methods
  doi: 10.1137/0608037
– volume: 51
  start-page: 4203
  issue: 12
  year: 2005
  ident: 114_CR19
  publication-title: IEEE Trans. Inform. Theory
  doi: 10.1109/TIT.2005.858979
– volume: 64
  start-page: 3566
  issue: 14
  year: 2016
  ident: 114_CR75
  publication-title: IEEE Trans. Signal Process.
  doi: 10.1109/TSP.2016.2550020
SSID ssj0009732
Score 2.274945
Snippet We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 387
SubjectTerms Algorithms
Computation
Convex and Discrete Geometry
Integer programming
Linear programming
Management Science
Mathematical programming
Mathematics
Mathematics and Statistics
Matrices (mathematics)
Operations Research
Operations Research/Decision Theory
Optimization
Signal reconstruction
Solvers
Statistics
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFH_o9DAPfkzF6ZQcPCga6EeaJt5EHB50iDrZrbRJqkM3pZvDP98kbdcpKuilUPoSSr7eL8l7vx_AfhokPiVCYEYVwUSSEPPYHocJ6rDUKCJZntnLsNNhvR6_LpLCRmW0e3klaVfqmWS3wIT3mKQbg-Ixn4cF7e6YEWy4ub2vqHZDK0vmcI9i7c79IlXm-zo-u6MKY365FrXepr3yv_9cheUCXaLTfDiswZwaNmBphnNQv11NiVpHDagbsJlzNa9DN5d40GZImyC91mRPJ2jQf1cSW1oJlaEinmtgjDTetYYHE3v0f4gG5mC9L9FDPxs_okKrZgO67fO7swtcyC5goefjGMecxIZnPfB4SiVzPKkxLSMiSQOpN4t6D0S5ko7LEspFKjXA8GKamKSo1JWpoP4m1IYvQ7UFyKFMKMZI4seEKFfXTB2ZeEkYB0bomjXBLVs_EgUnuZHGeI4qNmXTmpFuTRt9RyLehKNpmdeckeNX61bZqVExO0eRZ_TgiX76TTguO7H6_HNt238z34G6Z8aBTV1sQW2cvaldWBQT3bHZnh21Hzph47c
  priority: 102
  providerName: Springer Nature
Title Computing the spark: mixed-integer programming for the (vector) matroid girth problem
URI https://link.springer.com/article/10.1007/s10589-019-00114-9
https://www.proquest.com/docview/2239442233
Volume 74
WOSCitedRecordID wos000487544900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-2894
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009732
  issn: 0926-6003
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RLYf2wKugLpSVDxxA1CIPx7G5VFC1qgRdrVr6vESJ7cAKdluyy4qf3xmvl5RK7aWXUaI4VpTxY2Y8830Ab-qsSqUwhivpBBdW5FyXPhxmZKRqYkTyOLNf835fnZ7qQQi4TUJa5WJN9Au1vTAUI_-QEIe3QJluXf7mxBpFp6uBQmMJltGyiSmlaz8ZtKC7uScoi3QiOW7saSiaCaVzGSULUQkP-QRc_78xtdbmjQNSv-_sPr7vFz-BR8HiZJ_mQ-QpPHDjZ7B6DYdwDY7m3A54zdAeZLjIND8_stHwr7Pc40m4hoVErhE1QkPXN3w78zH_d2xEEfWhZd-HzfQHCyQ1z-Fod-fb9h4PfAvc4ESc8lKLkgDWs0TX0qoosWjMKmGqOrPoJaLzI7WzUawqqU1t0bJISllRNVQd29rI9AV0xhdjtw4skso4pUSVlkK4GHuWka2SKi8zYrhWXYgXP7swAYycODF-FS2MMimoQAX5tDtR6C68__fO5RyK487WGwutFGFaTopWJV3YXOi1fXx7by_v7u0VrCQ0lHyN4gZ0ps0f9xoemtl0OGl6sJSfnPVg-fNOf3CAd19yjnI_2u754UoyP0Q5yM5RHhweXwGEQOwk
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB3BggQcgLYglo_iQ5FaFYus43htJIRQWwRiu-IAEreQ2A6sYBfILl9_it-Ix5s0FKncOPQSRYozUuLn8dieeQ_gSxaloeBaUyksp9zwJlWJ3w7TIpAZKiJ5ntlWs92WJyfqcASeyloYTKssfaJ31OZK4x75BkMNb-6u4fb1DUXVKDxdLSU0hrA4sI_3bsnW39r_6fp3jbHdX0c_9mihKkC1g9uAJoonSCMeMZUJIwNmXMgmuU6zyLi1kAvxhbImaMhUKJ0ZN3-yRKRY85M1TKZF6OyOwhhHZjFMFWSHFclv0wuiBYoJ6gKJsCjSKUr1IkxOwpIhXINQ9fdEWEW3rw5k_Ty3O_O__aFZmC4iarIzHAIfYMT2PsLUC57FT3A81K5w98TFu8Q50fxik3Q7D9ZQz5dhc1IkqnWxkQvkfcOvd_5M4xvp4olBx5CzTj44J4UIzxwcv8t3zUOtd9WzC0ACIbWVkqdhwrltOMsiMClLm0mECt6yDo2yc2NdkK2j5sdlXNFEIyBiBwifVshjVYfvf965HlKNvNl6uURBXLidflxBoA7rJY6qx_-2tvi2tVWY2Dv63Ypb--2DJZhkCGNfj7kMtUF-a1dgXN8NOv38sx8QBE7fG1_P81tAXg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VFiE4UF4VW1rwASQQWM06jmMjoQpRVlStVnugUsUlTWynrGC3bXYp8Nf4dcx4HQJI9NYDlyhSnJESfx7PeB4fwOM6q1IlreVaecmlkzk3ZTgOsyrRNTEihT6z-_lwqA8PzWgJfrS1MJRW2erEoKjdiaUz8i1BHN4Sr-lWHdMiRjuD7dMzTgxSFGlt6TQWENnz37-i-zZ7tbuDc_1EiMHb92_e8cgwwC1Cb85LI0tqKZ4JUyunE-HQfNPSVnXm0C9Cc18Z75K-rpSxtcO9VJSqovqfuu9qq1KUewVWcvQxKZ1wlH3oGv7mgRwtMUJxNCrSWLATy_YySlSi8iHyR7j5c1PsLN2_grNhzxus_s9_6xbcjJY2e71YGrdhyU_vwI3f-i_ehYMFpwXeM7SDGSrX5tNLNhl_846HPhq-YTGBbUKD0MAPA5-eh1jHMzahSMLYseNxM__IIjnPPTi4lO9ag-XpydTfB5Yobb3WskpLKX0fJavEVaLKy4yYvXUP-u1EFzY2YScukM9F1z6awFEgOEK6oSxMD57_eud00YLkwtEbLSKKqI5mRQeHHrxoMdU9_re09YulPYJrCKtif3e49wCuC0J0KNPcgOV588VvwlV7Ph_PmodhbTA4umx4_QQiZUlK
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Computing+the+spark%3A+mixed-integer+programming+for+the+%28vector%29+matroid+girth+problem&rft.jtitle=Computational+optimization+and+applications&rft.au=Tillmann%2C+Andreas+M&rft.date=2019-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0926-6003&rft.eissn=1573-2894&rft.volume=74&rft.issue=2&rft.spage=387&rft.epage=441&rft_id=info:doi/10.1007%2Fs10589-019-00114-9&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0926-6003&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0926-6003&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0926-6003&client=summon