Let α ∈ (0, 2) and consider the operator Lf(x) = ∫ [f(x+ h)− f(x)− 1(|h|≤1)∇f(x) · h] A(x, h) |h|d+α dh, where the ∇f(x) · h term is omitted if α < 1. We consider the martingale problem corresponding to the operator L and under mild conditions on the function A prove that there exists a unique solution.

This paper derives an efficient solution procedure for solving the continuous version of the Evans modular design problem. The Kuhn-Tucker conditions are used to derive a dual problem which can be solved easily and whose dual variables indicate which equations should be tight. The technique retains a tree-basic solution throughout so that fast solution routines can be employed which are quite s...

The method called Arnoldi is currently a very popular method to solve largescale eigenvalue problems. The general purpose of this paper is to generalize Arnoldi to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem. The DDE can equivalently be expressed with a linear infinite dimensional operator which eigenvalues are the solutions to the ...

transmission network expansion planning (tnep) is an important component of power system planning. itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. different methods have been proposed for the solution of the static transmissionnetwork expansion planning (stnep) problem till now. but in all of them, stnep pr...

We explore Chord-like ring structures for Distributed Hash Tables (DHTs) and show that the Postage Stamp Problem (PSP) is equivalent to finding optimal structures for such ring topologies. We first leverage known results for that problem to design structures for ring-like DHTs that use shortest-path routing. We then describe a variant of the PSP that corresponds to ring-like DHTs that use greed...

We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route p paths from a start vertex to a target vertex in a given graph while using at most k edges more than once. We show that MSE can be decided on bounded grids in linear time when both dimensions are either small or large compared to the number p of paths. On the contrary, we show that MSE rem...

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...