In this work, we propose computationally tractable techniques for extracting valuable information from diverse data sources collected by multiple sensors in a variety of formats (visual, sonar, quantitative, qualitative, social information, etc.). More specifically, we develop an integrated approach consisting of two algorithms for extracting information and achieving a consensus-based, robust solution. The first algorithm extracts solutions from sensors within each data source, whereas the second algorithm reaches a compromise among the generated solutions from the previous algorithm across all data sources. To accomplish these goals, we initially transform the multisensor multitarget tracking problem (MSMTT) problem into a multidimensional assignment problem. Subsequently, we introduce a decomposition-based multisensor recursive approach referred to as a revised multisensor recursive algorithm, which can efficiently deliver a robust solution for each single data source MSMTT problem. In the second algorithm, we extend our methodology to the multisource MSMTT problem by introducing a connection-based symmetric nonnegative matrix factorization technique, which is shown to be computationally feasible and efficient in obtaining high-quality solutions. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the Army Research Laboratory [Grant G00006831]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0016 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0016 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Abstract Providing first aid and other supplies (e.g., epi‐pens, medical supplies, dry food, water) during and after a disaster is always challenging. The complexity of these operations increases when the transportation, power, and communications networks fail, leaving people stranded and unable to communicate their locations and needs. The advent of emerging technologies like uncrewed autonomous vehicles can help humanitarian logistics providers reach otherwise stranded populations after transportation network failures. However, due to the failures in telecommunication infrastructure, demand for emergency aid can become uncertain. To address the challenges of delivering emergency aid to trapped populations with failing infrastructure networks, we propose a novel robust computational framework for a two‐echelon vehicle routing problem that uses uncrewed autonomous vehicles (UAVs), or drones, for the deliveries. We formulate the problem as a two‐stage robust optimization model to handle demand uncertainty. Then, we propose a column‐and‐constraint generation approach for worst‐case demand scenario generation for a given set of truck and UAV routes. Moreover, we develop a decomposition scheme inspired by the column generation approach to generate UAV routes for a set of demand scenarios heuristically. Finally, we combine the decomposition scheme within the column‐and‐constraint generation approach to determine robust routes for both trucks (first echelon vehicles) and UAVs (second echelon vehicles), the time that affected communities are served, and the quantities of aid materials delivered. To validate our proposed algorithms, we use a simulated dataset that aims to recreate emergency aid requests in different areas of Puerto Rico after Hurricane Maria in 2017.

Identifying cause-effect relations among variables is a key step in the decision-making process. Whereas causal inference requires randomized experiments, researchers and policy makers are increasingly using observational studies to test causal hypotheses due to the wide availability of data and the infeasibility of experiments. The matching method is the most used technique to make causal inference from observational data. However, the pair assignment process in one-to-one matching creates uncertainty in the inference because of different choices made by the experimenter. Recently, discrete optimization models have been proposed to tackle such uncertainty; however, they produce 0-1 nonlinear problems and lack scalability. In this work, we investigate this emerging data science problem and develop a unique computational framework to solve the robust causal inference test instances from observational data with continuous outcomes. In the proposed framework, we first reformulate the nonlinear binary optimization problems as feasibility problems. By leveraging the structure of the feasibility formulation, we develop greedy schemes that are efficient in solving robust test problems. In many cases, the proposed algorithms achieve a globally optimal solution. We perform experiments on real-world data sets to demonstrate the effectiveness of the proposed algorithms and compare our results with the state-of-the-art solver. Our experiments show that the proposed algorithms significantly outperform the exact method in terms of computation time while achieving the same conclusion for causal tests. Both numerical experiments and complexity analysis demonstrate that the proposed algorithms ensure the scalability required for harnessing the power of big data in the decision-making process. Finally, the proposed framework not only facilitates robust decision making through big-data causal inference, but it can also be utilized in developing efficient algorithms for other nonlinear optimization problems such as quadratic assignment problems. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: This work was supported by the Division of Civil, Mechanical and Manufacturing Innovation of the National Science Foundation [Grant 2047094]. Supplemental Material: The online supplements are available at https://doi.org/10.1287/ijoc.2022.1226 .