Results 1 to 10 of about 218,505 (300)
Minimum cost flow problem with conflicts
AbstractThe minimum cost flow problem with conflicts is a recent extension of the ordinary minimum cost flow problem. It includes flow compatibility restrictions in addition to flow balance equalities and capacity constraints: at most one of the conflicting arcs can have positive flow.
Necati Aras, I Kuban Altınel
exaly +5 more sources
Accurate prediction of RNA secondary structure including pseudoknots through solving minimum-cost flow with learned potentials [PDF]
Pseudoknots are key structure motifs of RNA and pseudoknotted RNAs play important roles in a variety of biological processes. Here, we present KnotFold, an accurate approach to the prediction of RNA secondary structure including pseudoknots.
Tiansu Gong, Fusong Ju, Dongbo Bu
doaj +2 more sources
Solving biobjective network flow problem associated with minimum cost-time loading [PDF]
We apply a primal-dual simplex algorithm for solving the biobjective min imum cost-time network flow problem such that the total shipping cost and the total shipping fixed time are considered as the first and second objective functions, respectively.
O. Baghani, S. Ghafoori
doaj +1 more source
In this paper we show that every maximum minimum-cost flow over time problem has an optimal solution with a repeated structure if the given time horizon is large enough.
Miriam Schlöter, Robert Weismantel
openaire +2 more sources
Minimum Cost Flow-Based Integrated Model for Electric Vehicle and Crew Scheduling
Vehicle and crew scheduling is vital in public transit planning. Conventionally, the issues are handled sequentially as the vehicle scheduling problem (VSP) and crew scheduling problem (CSP).
Yindong Shen, Yuanyuan Li
doaj +1 more source
Economic pipe diameter of laterals in small tube irrigation system
Small tube irrigation is a new type of micro-irrigation that the emitters were replaced by small tubes. The small tubes of 4 mm diameter were connected to the laterals through the flow stabilizer or directly to the laterals.
Michael Aliyi Ame, Cai Shouhua
doaj +1 more source
Target tracker based on minimum cost flow modeling
A tracker using the method of minimum cost flow was designed to solve the problems of object occlusion, lighting effects and clutter disturbance. This tracker combines integer programming with the minimum cost flow model, and converts the prob-lem of ...
XI Zheng-hao +4 more
doaj +1 more source
This paper analyses the critical phase unwrapping step in a differential interferometric phase (D-InSAR) stack where both the solving of conventional methods and alternative approaches are discussed.
Christina Esch +3 more
doaj +1 more source
A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]
A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj
Capacity inverse minimum cost flow problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Güler, Cigdem, Hamacher, Horst
openaire +2 more sources

