Results 41 to 50 of about 3,135,949 (80)
Symmetric Reconstruction of Functional Liver Segments and Cross-Individual Correspondence of Hepatectomy. [PDF]
Diagnostics (Basel), 2021 Le DC +3 more
europepmc +1 more source
Abstract Supplement HIV Glasgow 8–11 November 2026, Glasgow, UK/Virtual
Journal of the International AIDS Society, Volume 29, Issue S6, November 2026.
wiley +1 more source
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems [PDF]
, 2016 The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice.
Illés, Tibor, Richárd, Molnár-Szipai
core +2 more sources
A Faster Primal Network Simplex Algorithm [PDF]
, 1996 We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time.
Aggarwal, Charu C. +2 more
core
A Hybrid Fuzzy Simplex Genetic Algorithm
, 2004 This paper presents a novel hybrid genetic algorithm that has the ability of the genetic algorithms to avoid being trapped at local minimum while accelerating the speed of local search by using the fuzzy simplex algorithm.
Trabia, Mohamed
core +2 more sources
A mass assignment based ID3 algorithm for decision tree induction [PDF]
, 1997 A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to discretize continuous feature universes and to reduce complexity when universes are discrete but with large cardinalities ...
Baldwin, JF, Martin, TP, Lawry, J
core +1 more source
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems [PDF]
, 2015 The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice.
Molnár-Szipai, Richárd +2 more
core +3 more sources
A genuinely polynomial primal simplex algorithm for the assignment problem [PDF]
, 1993 We present a primal simplex algorithm that solves the assignment problem in 1 2n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,...,n.
Akgül, M.
core +1 more source
Um modelo de fluxo em rede para solução de problemas de distribuição de produtos compostos [PDF]
, 2005 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Neste trabalho é proposto um modelo linear de Fluxo em Redes para o problema de minimização de custos de produção e ...
Machado, Catia Maria dos Santos
core