相关论文: New solution approaches for the maximum-reliabilit…

Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded…

Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to |V | and for…

In this work, we conduct the first systematic study of stochastic variational inequality (SVI) and stochastic saddle point (SSP) problems under the constraint of differential privacy (DP). We propose two algorithms: Noisy Stochastic…

For the well-known Survivable Network Design Problem (SNDP) we are given an undirected graph $G$ with edge costs, a set $R$ of terminal vertices, and an integer demand $d_{s,t}$ for every terminal pair $s,t\in R$. The task is to compute a…

Newly arriving nodes in dynamics networks would gradually make the node embedding space drifted and the retraining of node embedding and downstream models indispensable. An exact threshold size of these new nodes, below which the node…

In this paper, we study distributionally risk-receptive and distributionally robust (or risk-averse) multistage stochastic mixed-integer programs (denoted by DRR- and DRO-MSIPs). We present cutting plane-based and reformulation-based…

A computational PDE-constrained optimization approach is proposed for optimal trajectory planning under uncertainty by means of an associated Schroedinger Bridge Problem (SBP). The proposed SBP formulation is interpreted as the mean-field…

For a network formed by nodes and undirected links between pairs of nodes, the network optimal attack problem aims at deleting a minimum number of target nodes to break the network down into many small components. This problem is…

In this work, we introduce a novel strategy for tackling constrained optimization problems through a modified penalty method. Conventional penalty methods convert constrained problems into unconstrained ones by incorporating constraints…

We study submodular optimization in adversarial context, applicable to machine learning problems such as feature selection using data susceptible to uncertainties and attacks. We focus on Stackelberg games between an attacker (or…

The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned…

Supply chain transportation operations often account for a large proportion of product total cost to market. Such operations can be optimized by solving the Logistics Service Network Design Problem (LSNDP), wherein a logistics service…

Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. For a graph with rational weights, the decision problem of whether the SDP relaxation for the maximum cut problem is exact is known to be $NP$-hard;…

Although neural networks have been applied to several systems in recent years, they still cannot be used in safety-critical systems due to the lack of efficient techniques to certify their robustness. A number of techniques based on convex…

Let $G = (V,E,w)$ be a weighted, digraph subject to a sequence of adversarial edge deletions. In the decremental single-source reachability problem (SSR), we are given a fixed source $s$ and the goal is to maintain a data structure that can…

We propose a novel problem formulation of continuous-time information propagation on heterogenous networks based on jump stochastic differential equations (SDE). The structure of the network and activation rates between nodes are naturally…

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the…

Resilience and robustness are important properties in the reliability and attack-tolerance analysis of networks. In recent decades, various qualitative and heuristic-based quantitative approaches have made significant contributions in…

The \textit{Multi-Constraint Shortest Path (MCSP)} problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It is typically processed as a \textit{skyline path} problem. However, the number of…

In this article, we study a biobjective extension of the shortest path network interdiction problem. Each arc in the network is associated with two integer length values and two players compute their respective shortest paths from source to…