![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Amitabh Basu
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Sammy Khalife
, Hongyu Cheng, Amitabh Basu
:
Neural networks with linear threshold activations: structure and algorithms. Math. Program. 206(1): 333-356 (2024) - [e1]Amitabh Basu
, Ali Ridha Mahjoub
, Juan José Salazar González
:
Combinatorial Optimization - 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14594, Springer 2024, ISBN 978-3-031-60923-7 [contents] - [i24]Hongyu Cheng, Sammy Khalife, Barbara Fiedorowicz, Amitabh Basu:
Data-driven algorithm design using neural networks with applications to branch-and-cut. CoRR abs/2402.02328 (2024) - [i23]Hongyu Cheng, Amitabh Basu:
Learning Cut Generating Functions for Integer Programming. CoRR abs/2405.13992 (2024) - 2023
- [j46]Amitabh Basu
, Hongyi Jiang
:
Two-halfspace closure. Math. Program. 197(1): 411-426 (2023) - [j45]Amitabh Basu
, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198(1): 787-810 (2023) - [j44]Amitabh Basu
:
Complexity of optimizing over the integers. Math. Program. 200(2): 739-780 (2023) - [j43]Hayden S. Helm
, Amitabh Basu
, Avanti Athreya, Youngser Park
, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding
, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson
, Marah Ihab Abdin
, Piali Choudhury, Weiwei Yang, Christopher W. White:
Distance-based positive and unlabeled learning for ranking. Pattern Recognit. 134: 109085 (2023) - [j42]Christoph Hertrich
, Amitabh Basu
, Marco Di Summa
, Martin Skutella
:
Towards Lower Bounds on the Depth of ReLU Neural Networks. SIAM J. Discret. Math. 37(2): 997-1029 (2023) - [c21]Amitabh Basu
, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro:
Information Complexity of Mixed-Integer Convex Optimization. IPCO 2023: 1-13 - [i22]Sammy Khalife, Amitabh Basu:
On the power of graph neural networks and the role of the activation function. CoRR abs/2307.04661 (2023) - 2022
- [j41]Amitabh Basu
, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. 42(6): 971-996 (2022) - [j40]Hongyi Jiang, Amitabh Basu
:
Enumerating Integer Points in Polytopes with Bounded Subdeterminants. SIAM J. Discret. Math. 36(1): 449-460 (2022) - [c20]Sammy Khalife
, Amitabh Basu
:
Neural Networks with Linear Threshold Activations: Structure and Algorithms. IPCO 2022: 347-360 - 2021
- [j39]Amitabh Basu
, Christopher Thomas Ryan, Sriram Sankaranarayanan
:
Mixed-integer bilevel representability. Math. Program. 185(1-2): 163-197 (2021) - [j38]Amitabh Basu
, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Split Cuts in the Plane. SIAM J. Optim. 31(1): 331-347 (2021) - [j37]Amitabh Basu
, Tu Nguyen, Ao Sun:
Admissibility of Solution Estimators for Stochastic Optimization. SIAM J. Math. Data Sci. 3(1): 31-51 (2021) - [c19]Amitabh Basu
, Michele Conforti
, Marco Di Summa
, Hongyi Jiang
:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO 2021: 383-398 - [c18]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS 2021: 3336-3348 - [i21]Christoph Hertrich
, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR abs/2105.14835 (2021) - [i20]Hayden S. Helm, Marah Ihab Abdin, Benjamin D. Pedigo, Shweti Mahajan, Vince Lyzinski, Youngser Park, Amitabh Basu, Piali Choudhury, Christopher M. White, Weiwei Yang, Carey E. Priebe:
Leveraging semantically similar queries for ranking via combining representations. CoRR abs/2106.12621 (2021) - [i19]Amitabh Basu:
Complexity of optimizing over the integers. CoRR abs/2110.06172 (2021) - [i18]Amitabh Basu, Tongtong Chen, Michele Conforti, Hongyi Jiang:
Helly systems and certificates in optimization. CoRR abs/2111.05225 (2021) - [i17]Sammy Khalife, Amitabh Basu:
Neural networks with linear threshold activations: structure and algorithms. CoRR abs/2111.08117 (2021) - 2020
- [j36]Amitabh Basu
, Michele Conforti
, Marco Di Summa:
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179(1): 447-453 (2020) - [i16]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR abs/2003.05023 (2020) - [i15]Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Christopher M. White, Carey E. Priebe:
Learning to rank via combining representations. CoRR abs/2005.10700 (2020) - [i14]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR abs/2011.05474 (2020)
2010 – 2019
- 2019
- [j35]Amitabh Basu
, Michele Conforti
, Marco Di Summa
, Giacomo Zambelli
:
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44(4): 1208-1220 (2019) - [j34]Amitabh Basu
, R. Kipp Martin, Christopher Thomas Ryan
, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. Math. Oper. Res. 44(4): 1264-1285 (2019) - [j33]Amitabh Basu
, Michele Conforti
, Marco Di Summa
, Joseph Paat
:
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44(4): 1412-1430 (2019) - [j32]Amitabh Basu
, Santanu S. Dey
, Joseph Paat:
Nonunique Lifting of Integer Variables in Minimal Inequalities. SIAM J. Discret. Math. 33(2): 755-783 (2019) - [j31]Amitabh Basu
, Sriram Sankaranarayanan
:
Can Cut-Generating Functions Be Good and Efficient? SIAM J. Optim. 29(2): 1190-1210 (2019) - 2018
- [j30]Amitabh Basu
, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme functions with an arbitrary number of slopes. Math. Program. 172(1-2): 303-327 (2018) - [j29]Amitabh Basu
, Robert Hildebrand
, Marco Molinaro:
Minimal cut-generating functions are nearly extreme. Math. Program. 172(1-2): 329-349 (2018) - [j28]Gennadiy Averkov, Amitabh Basu
, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM J. Optim. 28(1): 904-929 (2018) - [j27]Teresa M. Lebair, Amitabh Basu
:
Approximation of Minimal Functions by Extreme Functions. SIAM J. Optim. 28(3): 2518-2540 (2018) - [c17]Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee:
Understanding Deep Neural Networks with Rectified Linear Units. ICLR (Poster) 2018 - [c16]Akshay Rangamani, Anirbit Mukherjee, Amitabh Basu
, Ashish Arora, Tejaswini Ganapathi, Sang (Peter) Chin, Trac D. Tran:
Sparse Coding and Autoencoders. ISIT 2018: 36-40 - [i13]Amitabh Basu, Soham De, Anirbit Mukherjee, Enayat Ullah:
Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders. CoRR abs/1807.06766 (2018) - 2017
- [j26]Amitabh Basu
, Richard Kipp Martin, Christopher Thomas Ryan:
Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. 161(1-2): 451-485 (2017) - [j25]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe:
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. 163(1-2): 301-358 (2017) - [j24]Amitabh Basu
, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge
:
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6): 671-674 (2017) - [j23]Amitabh Basu
, Timm Oertel
:
Centerpoints: A Link between Optimization and Convex Geometry. SIAM J. Optim. 27(2): 866-889 (2017) - [c15]Gennadiy Averkov, Amitabh Basu
, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO 2017: 51-62 - [c14]Amitabh Basu
, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. IPCO 2017: 63-74 - [c13]Amitabh Basu
, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang:
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. IPCO 2017: 75-85 - [i12]Akshay Rangamani, Anirbit Mukherjee, Ashish Arora, Tejaswini Ganapathy, Amitabh Basu, Sang (Peter) Chin, Trac D. Tran:
Critical Points Of An Autoencoder Can Provably Recover Sparsely Used Overcomplete Dictionaries. CoRR abs/1708.03735 (2017) - [i11]Anirbit Mukherjee, Amitabh Basu:
Lower bounds over Boolean inputs for deep neural networks with ReLU gates. CoRR abs/1711.03073 (2017) - [i10]Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee:
Understanding Deep Neural Networks with Rectified Linear Units. Electron. Colloquium Comput. Complex. TR17 (2017) - [i9]Anirbit Mukherjee, Amitabh Basu:
Lower bounds over Boolean inputs for deep neural networks with ReLU gates. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j22]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe
:
Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14(1): 1-40 (2016) - [j21]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe
:
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2): 107-131 (2016) - [c12]Amitabh Basu
, Michael Dinitz
, Xin Li:
Computing Approximate PSD Factorizations. APPROX-RANDOM 2016: 2:1-2:12 - [c11]Amitabh Basu
, Timm Oertel:
Centerpoints: A Link Between Optimization and Convex Geometry. IPCO 2016: 14-25 - [c10]Amitabh Basu
, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme Functions with an Arbitrary Number of Slopes. IPCO 2016: 190-201 - [c9]Amitabh Basu
, Robert Hildebrand
, Marco Molinaro:
Minimal Cut-Generating Functions are Nearly Extreme. IPCO 2016: 202-213 - [i8]Amitabh Basu, Michael Dinitz, Xin Li:
Computing approximate PSD factorizations. CoRR abs/1602.07351 (2016) - [i7]Raman Arora, Amitabh Basu, Poorya Mianjy, Anirbit Mukherjee:
Understanding Deep Neural Networks with Rectified Linear Units. CoRR abs/1611.01491 (2016) - 2015
- [j20]Amitabh Basu
, Marco Molinaro:
Characterization of the split closure via geometric lifting. Eur. J. Oper. Res. 243(3): 745-751 (2015) - [j19]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe
:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. Math. Oper. Res. 40(1): 105-129 (2015) - [j18]Amitabh Basu
, R. Kipp Martin, Christopher Thomas Ryan:
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. Math. Oper. Res. 40(1): 146-170 (2015) - [j17]Amitabh Basu
, Michele Conforti, Marco Di Summa:
A geometric approach to cut-generating functions. Math. Program. 151(1): 153-189 (2015) - [j16]Gennadiy Averkov, Amitabh Basu
:
Lifting properties of maximal lattice-free polyhedra. Math. Program. 154(1-2): 81-111 (2015) - [j15]Amitabh Basu
, Joseph Paat:
Operations that Preserve the Covering Property of the Lifting Region. SIAM J. Optim. 25(4): 2313-2333 (2015) - 2014
- [j14]Amitabh Basu
, Jesús A. De Loera, Mark Junod:
On Chubanov's Method for Linear Programming. INFORMS J. Comput. 26(2): 336-350 (2014) - [j13]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe
:
The triangle closure is a polyhedron. Math. Program. 145(1-2): 19-58 (2014) - [j12]Amitabh Basu
, R. Kipp Martin, Christopher Thomas Ryan:
On the sufficiency of finite support duals in semi-infinite linear programming. Oper. Res. Lett. 42(1): 16-20 (2014) - [c8]Gennadiy Averkov, Amitabh Basu
:
On the Unique-Lifting Property. IPCO 2014: 76-87 - [i6]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2. CoRR abs/1403.4628 (2014) - [i5]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the Infinite Group Relaxation. CoRR abs/1410.8584 (2014) - 2013
- [j11]Amitabh Basu
, Manoel B. Campêlo
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1-2): 561-576 (2013) - [j10]Amitabh Basu
, Robert Hildebrand
, Matthias Köppe
, Marco Molinaro:
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23(2): 1021-1040 (2013) - [c7]Amitabh Basu
, Robert Hildebrand, Matthias Köppe
:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. IPCO 2013: 62-73 - 2012
- [j9]Amitabh Basu
, Gérard Cornuéjols, François Margot:
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37(1): 21-40 (2012) - [j8]Amitabh Basu
, Gérard Cornuéjols, Matthias Köppe
:
Unique Minimal Liftings for Simplicial Polytopes. Math. Oper. Res. 37(2): 346-355 (2012) - [j7]Amitabh Basu
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133(1-2): 25-38 (2012) - [i4]Amitabh Basu, Jesús A. De Loera, Mark Junod:
On Chubanov's method for Linear Programming. CoRR abs/1204.2031 (2012) - [i3]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case. CoRR abs/1210.6732 (2012) - 2011
- [j6]Amitabh Basu
, Pierre Bonami, Gérard Cornuéjols, François Margot:
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23(4): 578-590 (2011) - [j5]Amitabh Basu
, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2): 281-314 (2011) - [c6]Amitabh Basu
, Gérard Cornuéjols, Marco Molinaro:
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO 2011: 27-38 - [i2]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets. CoRR abs/1107.5068 (2011) - [i1]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The Triangle Closure is a Polyhedron. CoRR abs/1111.1780 (2011) - 2010
- [j4]Amitabh Basu
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010) - [j3]Amitabh Basu
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24(1): 158-168 (2010) - [c5]Amitabh Basu
, Manoel B. Campêlo
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95
2000 – 2009
- 2009
- [j2]Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Geometric algorithms for optimal airspace design and air traffic controller workload balancing. ACM J. Exp. Algorithmics 14 (2009) - [c4]Amitabh Basu
, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. SODA 2009: 1220-1229 - 2008
- [c3]Amitabh Basu
, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. ALENEX 2008: 75-89 - 2007
- [j1]Gilles Barthe
, Tamara Rezk, Amitabh Basu
:
Security types preserving compilation. Comput. Lang. Syst. Struct. 33(2): 35-59 (2007) - 2006
- [c2]Amitabh Basu
, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Distributed localization using noisy distance and angle information. MobiHoc 2006: 262-273 - 2004
- [c1]Gilles Barthe, Amitabh Basu
, Tamara Rezk:
Security Types Preserving Compilation: (Extended Abstract). VMCAI 2004: 2-15
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint