0

Let G = (V,E) be a graph and R ⊆ E. A matching M in G is called R-feasible if the subgraph induced by the M -saturated vertices does not have an edge of R. We show that the general problem of finding a maximum size Rfeasible matching in G is NP-hard and identify several natural applications of this new concept. In particular, we use R-feasible matchings to give a necessary and sufficient condit...

In this paper, we study inverse optimization problems defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x0 be a given feasible solution. The solution x0 may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to perturb the cost vector c to d so that x0 is a...

in this paper we consider a petrovsky viscoelastic inverse source problem with memory term in the boundary condition. we obtain sufficient conditions on relaxation function and initial data for which the solutions of problem are asymptotically stable when the integral overdetermination tends to zero as time goes to infinity.

‎in this study‎, ‎properties of spectral characteristic are investigated for‎ ‎singular sturm-liouville operators in the case where an eigen‎ ‎parameter not only appears in the differential equation but is‎ ‎also linearly contained in the jump conditions‎. ‎also weyl function‎ ‎for considering operator has been defined and the theorems which‎ ‎related to uniqueness of solution of inverse proble...

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow x becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. Here, we consider the capacity inver...

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow x becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. Here, we consider the capacity inver...

mathematical simulation of flow toward drains is an important and indispensable stage in drainage design and management. many related models have been developed, but most of them simulate the saturated flow toward drains without a due consideration of the unsaturated zone. in this study, the two dimensional differential equation governing saturated and unsaturated flow in porous media is numeri...

in this paper, two inverse problems of stephen kind with local (dirichlet) boundary conditions are investigated. in the first problem only a part of boundary is unknown and in the second problem, the whole of boundary is unknown. for the both of problems, at first, analytic expressions for unknown boundary are presented, then by using these analytic expressions for unknown boundaries and bounda...