Manish Bansal
Orcid: 0000-0002-9904-8826
According to our database1,
Manish Bansal
authored at least 29 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A Prototype on the Feasibility of Learning Spatial Provenance in XBee and LoRa Networks.
Proceedings of the 16th International Conference on COMmunication Systems & NETworkS, 2024
2023
Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set.
Networks, January, 2023
A Neural Bag-of-Words Point Process Model for User Return Time Prediction in E-commerce.
Proceedings of the Adjunct Proceedings of the 31st ACM Conference on User Modeling, 2023
2022
Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization.
SIAM J. Optim., September, 2022
Oper. Res. Lett., 2022
Secure and ultra-reliable provenance recovery in sparse networks: Strategies and performance bounds.
Ad Hoc Networks, 2022
Learning-to-Spell: Weak Supervision based Query Correction in E-Commerce Search with Small Strong Labels.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022
2021
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs.
J. Glob. Optim., 2021
2020
Planar Maximum Coverage Location Problem with Partial Coverage, Continuous Spatial Demand, and Adjustable Quality of Service.
CoRR, 2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Proceedings of the 2020 International Conference on COMmunication Systems & NETworkS, 2020
2019
On solving two-stage distributionally robust disjunctive programs with a general ambiguity set.
Eur. J. Oper. Res., 2019
Facets for single module and multi-module capacitated lot-sizing problems without backlogging.
Discret. Appl. Math., 2019
Two-stage stochastic programming approach for path planning problems under travel time and availability uncertainties.
CoRR, 2019
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019
2018
Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs.
SIAM J. Optim., 2018
SIAM J. Optim., 2018
2017
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones.
INFORMS J. Comput., 2017
Facets for continuous multi-mixing set with general coefficients and bounded integer variables.
Discret. Optim., 2017
2016
Automated Full Chip SPICE simulations with self-checking assertions for last mile verification & first pass Silicon of mixed signal SoCs.
Proceedings of the 29th IEEE International System-on-Chip Conference, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
2015
n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem.
Math. Program., 2015
2014
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
Hybridization of Bound-and-Decompose and Mixed Integer Feasibility Checking to Measure Redundancy in Structured Linear Systems.
IEEE Trans Autom. Sci. Eng., 2013
2012
J. Biomed. Informatics, 2012
2011
Proceedings of the 2011 International Conference on Document Analysis and Recognition, 2011
2002
Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002