Search results for "Modeling and Simulation"
showing 10 items of 1561 documents
Flow resistance law under equilibrium bed-load transport conditions
2018
Abstract The uniform flow resistance equation, in the form due to Manning or Darcy-Weisbach, is often applied to determine the stage-discharge relationship of a river cross-section. The application of this equation, namely the slope-area method, allows to indirectly measure by water level readings the corresponding river discharge. In this paper, a recently deduced flow resistance equation for open channel flow was tested during conditions of equilibrium bed-load transport. First the flow resistance equation was determined by dimensional analysis and applying the condition of incomplete self-similarity for the flow velocity profile. Then the analysis was developed by the following steps: (i…
Comments on “Mean velocity and turbulent characteristics of flow over half-cycle cosine sharp-crested weirs” by Salehi S., Esmaili K., Azimi A.H.
2019
Abstract In this paper the stage-discharge equation of a half-cycle cosine weir is theoretically deduced applying the Π-Theorem of dimensional analysis and the self-similarity theory. The coefficients of the new stage-discharge relationships are estimated using the results of the experimental runs by Salehi et al..
On Boundary Value Problems for ϕ-Laplacian on the Semi-Infinite Interval
2017
The Dirichlet problem and the problem with functional boundary condition for ϕ-Laplacian on the semi-infinite interval are studied as well as solutions between the lower and upper functions.
On Strong Convergence of Halpern’s Method for Quasi-Nonexpansive Mappings in Hilbert Spaces
2016
In this paper, we introduce a Halpern’s type method to approximate common fixed points of a nonexpansive mapping T and a strongly quasi-nonexpansive mappings S, defined in a Hilbert space, such that I − S is demiclosed at 0. The result shows as the same algorithm converges to different points, depending on the assumptions of the coefficients. Moreover, a numerical example of our iterative scheme is given.
An exact method for graph coloring
2006
International audience; We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.
The Steiner Traveling Salesman Problem and its extensions
2019
Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.
On generalized weakly G-contraction mapping in G-metric spaces
2011
In this paper, we establish some common fixed point results for two self-mappings f and g on a generalized metric space X. To prove our results we assume that f is a generalized weakly G-contraction mapping of types A and B with respect to g.
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.
Branch and bound for the cutwidth minimization problem
2013
The cutwidth minimization problem consists of finding a linear arrangement of the vertices of a graph where the maximum number of cuts between the edges of the graph and a line separating consecutive vertices is minimized. We first review previous approaches for special classes of graphs, followed by lower bounds and then a linear integer formulation for the general problem. We then propose a branch-and-bound algorithm based on different lower bounds on the cutwidth of partial solutions. Additionally, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic to obtain good initial solutions. The combination of the branch-and-bound and GRASP methods results in optimal solu…
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
2014
The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. The problem has appeared under several different names in the literature, including maximum weight induced subgraph, maximum weight biclique, matrix factorization and maximum cut on bipartite graphs. There are only two unpublished works (technical reports) where heuristic approaches are tested on BQP instances. Our goal is to combine straightforward search elements to balance diversification and intensification in bot…