相关论文: The Summed Start-up Costs in a Unit Commitment Pro…

For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ If, moreover, each vertex $u \in V(D)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the…

With increased reliance on cyber infrastructure, large scale power networks face new challenges owing to computational scalability. In this paper we focus on developing an asynchronous decentralized solution framework for the Unit…

We consider combinatorial optimization problems defined over random ensembles, and study how solution cost increases when the optimal solution undergoes a small perturbation delta. For the minimum spanning tree, the increase in cost scales…

In this note, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of $N$ demands and $N$ supplies in $\mathbf{R}$ in the case where the cost function is…

We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and a set of products associated with a constant demand rate,…

In this work, we study a single-machine scheduling problem that aims at minimizing the total cost of a schedule subject to start-time dependent costs. This framework naturally captures scenarios where costs fluctuate throughout the day,…

We compute the integral of a function or the expectation of a random variable with minimal cost and use, for our new algorithm and for upper bounds of the complexity, i.i.d. samples. Under certain assumptions it is possible to select a…

Many problems in robotics seek to simultaneously optimize several competing objectives under constraints. A conventional approach to solving such multi-objective optimization problems is to create a single cost function comprised of the…

This paper proposes a data-driven version of the Benders decomposition algorithm applied to the stochastic unit commitment (SUC) problem. The proposed methodology aims at finding a trade-off between the size of the Benders master problem…

This paper characterizes convex information costs using an axiomatic approach. We employ mixture convexity and sub-additivity, which capture the idea that producing "balanced" outputs is less costly than producing ``extreme'' ones. Our…

Hydro unit commitment is the problem of maximizing water use efficiency while minimizing start-up costs in the daily operation of multiple hydro plants, subject to constraints on short-term reservoir operation, and long-term goals. A…

In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for…

The matrix completion problem has been studied broadly under many underlying conditions. The problem has been explored under adaptive or non-adaptive, exact or estimation, single-phase or multi-phase, and many other categories. In most of…

In this paper, we present a distributed algorithm for solving convex, constraint-coupled, optimization problems over peer-to-peer networks. We consider a network of processors that aim to cooperatively minimize the sum of local cost…

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

In this paper we propose an extension of the Uncapacitated Hub Location Problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We…

We propose a novel computational method for unit commitment UC, which does not require linearized approximation and provides several orders of magnitude performance improvement over current state-of-the-art. The performance improvement is…

Keeping the balance between supply and demand is a fundamental task in power system operational planning practices. This task becomes particularly challenging due to the deepening penetration of renewable energy resources, which induces a…

The system operator's scheduling problem in electricity markets, called unit commitment, is a non-convex mixed-integer program. The optimal value function is non-convex, preventing the application of traditional marginal pricing theory to…

We present new two-party protocols for the Unbalanced Private Set Union (UPSU) problem. Here, the Sender holds a set of data points, and the Receiver holds another (possibly much larger) set, and they would like for the Receiver to learn…