#### Filter Results:

#### Publication Year

2010

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-ε reliability criterion. This reliability criterion is a generalization of the well-known N-k criterion, and dictates that at least (1 − ε j) fraction of the total system demand must be met… (More)

—We consider the problem of designing (or augmenting) an electric power system such that it satisfies the N-k-ε survivability criterion while minimizing total cost. The survivability criterion requires that at least (1 − ε) fraction of the total demand can still be met even if any k (or fewer) of the system components fail. We formulate this problem, taking… (More)

- Elham Sadeghi, Neng Fan
- 2015

In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ-edge-connected k-subgraph problem, or the (k, λ)-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ = 1), λ-edge-connected spanning subgraph problem (if k = |V |)… (More)

- Elham Sadeghi, Neng Fan
- 2015

A graph is said to be (k, l)-connected if the resulted graph after removing of any k vertices and (l − 1) edges or removing of any (k − 1) vertices and l edges is still connected. Beineke and Harary (1967) (see [1]) claimed to prove that there should be k + l edge-disjoint paths, of which k are vertex-disjoint, between any pair of vertices if the graph has… (More)