Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Amitabh Basu"'
Publikováno v:
The Astronomical Journal, Vol 166, Iss 4, p 174 (2023)
We propose a novel exact method to solve the probabilistic catalog matching problem faster than previously possible. Our new approach uses mixed integer programming and introduces quadratic constraints to shrink the problem by multiple orders of magn
Externí odkaz:
https://doaj.org/article/b55a764a42f644b8b58139e57e24a142
Autor:
Amitabh Basu, Hongyi Jiang
Publikováno v:
Mathematical Programming. 197:411-426
We define a new cutting plane closure for pure integer programs called the two-halfspace closure. It is a natural generalization of the well-known Chv\'atal-Gomory closure. We prove that the two-halfspace closure is polyhedral. We also study the corr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61e424243a51be6bfcaea7132143861f
https://doi.org/10.1007/s10107-022-01802-x
https://doi.org/10.1007/s10107-022-01802-x
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33def1f7caf6536454d5c1c81abd4c93
https://doi.org/10.1007/978-3-031-32726-1_1
https://doi.org/10.1007/978-3-031-32726-1_1
Publikováno v:
Monthly Notices of the Royal Astronomical Society. 498:565-573
Cross-matching catalogues from radio surveys to catalogues of sources at other wavelengths is extremely hard, because radio sources are often extended, often consist of several spatially separated components, and often no radio component is coinciden
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc03caf7d2807f533df318ec13aa5dbc
https://doi.org/10.1093/mnras/staa2447
https://doi.org/10.1093/mnras/staa2447
Autor:
Sammy Khalife, Amitabh Basu
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e52f37a954dcb23510bf63d56c0c82ab
https://doi.org/10.1007/978-3-031-06901-7_26
https://doi.org/10.1007/978-3-031-06901-7_26
Building on previous Bayesian approaches, we introduce a novel formulation of probabilistic cross-identification, where detections are directly associated to (hypothesized) astronomical objects in a globally optimal way. We show that this new method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a74271b46cdde8204d2b0d605b52b11a
Publikováno v:
Mathematics of Operations Research. 44:1264-1285
Jeroslow and Lowe gave an exact geometric characterization of subsets of [Formula: see text] that are projections of mixed-integer linear sets, also known as MILP-representable or MILP-R sets. We give an alternate algebraic characterization by showin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc2edebb471e28ae46b32e4225837f5b
https://doi.org/10.1287/moor.2018.0967
https://doi.org/10.1287/moor.2018.0967
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:755-783
We explore the lifting question in the context of cut-generating functions. Most of the prior literature on this question focuses on cut-generating functions that have the unique lifting property. ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f92f8ce9ea371d0f4b88bc4e8964810
https://doi.org/10.1137/17m1117070
https://doi.org/10.1137/17m1117070
Autor:
Amitabh Basu, Sriram Sankaranarayanan
Publikováno v:
SIAM Journal on Optimization. 29:1190-1210
Making cut generating functions (CGFs) computationally viable is a central question in modern integer programming research. One would like to find CGFs that are simultaneously good, i.e., there are good guarantees for the cutting planes they generate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e004aab5da5f2ffbe847f6f352ca7fc4
https://doi.org/10.1137/18m117354x
https://doi.org/10.1137/18m117354x
This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22–24, 2024. The 30 full papers included in this book were carefully reviewed