Results 61 to 70 of about 87,677 (298)
Complexity of the Transshipment Problem with a Permutable Transit Vector
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2010 In this paper, we show that the transshipment problem with a permutable transit vector remains NP-hard even when each entry of the given transit vector takes either zero or two. We prove the hardness by a reduction from an NP-complete problem by the name
Yoshiyuki KARUNO +2 more
doaj +1 more source
Optimization of the Production of Rubber Compounds Using Mathematical Models
Advanced Engineering Materials, EarlyView.Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance [PDF]
Yugoslav Journal of Operations Research, 2017 Given a network G(V,A,c) and a collection of origin-destination pairs with prescribed values, the reverse shortest path problem is to modify the arc length vector c as little as possible under some bound constraints such that the shortest ...
Tayyebi Javad, Aman Massoud
doaj +1 more source
An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials
Advanced Engineering Materials, EarlyView.An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut +16 more
wiley +1 more source
The Existence of Equilibrium Flows
Journal of Mechanism and Institution DesignIn this paper, we establish conditions for the existence of an equilibrium in the equilibrium flow problem studied by Galichon et al. (2024). The problem nests several classical economic models such as bipartite matching models, hedonic pricing models ...
Alfred Galichon +2 more
doaj +1 more source
Knowledge Graph Completion With Pattern-Based Methods
IEEE AccessKnowledge graphs (KGs) are popularly used to develop several intelligent applications. Revealing valuable knowledge hidden in these graphs opened up a branch of research, known as KG reasoning, aiming at predicting the missing links.
Maryam Sabet +2 more
doaj +1 more source
, 2007 Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem.
Kolmogorov, V., Shioura, A.
core
Advanced Engineering Materials, EarlyView.Aluminum and nitride coatings are used in industry because they are hard, resist wear, and protect against oxidation. Adding boron can improve friction behavior and other properties. This study tests coatings on surfaces with different finishes. Results show smoother surfaces perform better, while rough ones wear faster, although coatings can reduce ...
Adrián Claver +9 more
wiley +1 more source
Probabilistic Load Flow Solution Considering Optimal Allocation of SVC in Radial Distribution System
International Journal of Interactive Multimedia and Artificial Intelligence, 2018 This paper proposes a solution procedure for probabilistic load flow problem considering the optimal allocation of Static Var Compensator (SVC) in radial distribution systems.
Walaa Ahmed +4 more
doaj +1 more source
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
, 1988 We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path ...
James B. Orlin, James Orlin
core +1 more source