Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "minimum cost flow" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    A scaling out-of-kilter algorithm for minimum cost flow
    Autorzy:
    Ciupala, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/970996.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    network flow
    minimum cost flow
    shortest path
    scaling technique
    Opis:
    The out-of-kilter algorithm is one of the basic algorithms that solve the minimum cost flow problem. Its drawback is that it can improve the objective function at each iteration by only a small value. Consequently, it runs in pseudo-polynomial time. In this paper, we describe a new out-of-kilter algorithm for minimum cost flow that runs in polynomial time. Our algorithm is a scaling algorithm and improves the objective function at each time by a "sufficiently large" value.
    Źródło:
    Control and Cybernetics; 2005, 34, 4; 1169-1174
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimizing the minimum cost flow algorithm for the phase unwrapping process in SAR radar
    Autorzy:
    Dudczyk, J.
    Kawalec, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/200190.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    IFSAR
    Interferometry Synthetic Aperture Radar
    minimum cost flow
    MCF
    phase unwrapping
    PhU
    Opis:
    The last three decades have been abundant in various solutions to the problem of Phase Unwrapping in a SAR radar. Basically, all the existing techniques of Phase Unwrapping are based on the assumption that it is possible to determine discrete ”derivatives” of the unwrapped phase. In this case a discrete derivative of the unwrapped phase means a phase difference (phase gradient) between the adjacent pixels if the absolute value of this difference is less than π. The unwrapped phase can be reconstructed from these discrete derivatives by adding a constant multiple of 2π. These methods differ in that the above hypothesis may be false in some image points. Therefore, discrete derivatives determining the unwrapped phase will be discontinuous, which means they will not form an irrotational vector field. Methods utilising branch-cuts unwrap the phase by summing up specific discrete partial derivatives of the unwrapped phase along a path. Such an approach enables internally cohesive results to be obtained. Possible summing paths are limited by branch-cuts, which must not be intersected. These branch-cuts connect local discontinuities of discrete partial derivatives. The authors of this paper performed parametrization of the Minimum Cost Flow algorithm by changing the parameter determining the size of a tile, into which the input image is divided, and changing the extent of overlapping of two adjacent tiles. It was the basis for determining the optimum (in terms of minimum Phase Unwrapping time) performance of the Minimum Cost Flow algorithm in the aspect of those parameters.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 3; 511-516
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new polynomial-time implementation of the out-of-kilter algorithm using Minty’s lemma
    Autorzy:
    Ghiyasvand, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205633.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    network flows
    minimum cost flow problem
    out- of-kilter algorithm
    Minty’s lemma
    Opis:
    It is less well known how to use the out-of-kilter idea to solve the min-cost flow problem because the generic version of the out-of-kilter algorithm runs in exponential time, although it is the sort of algorithm that computers can do easily. Ciupala (2005) presented a scaling out-of-kilter algorithm that runs in polynomial time using the shortest path computation in each phase. In this paper, we present a new polynomial time implementation of out-of-kilter idea. The algorithm uses a scaling method that is different from Ciupala’s scaling method. Each phase of Ciupala’s method needs a shortest path computation, while our algorithm uses Minty’s lemma to transform all the out-of-kilter arcs into in-kilter arcs. When the given network is infeasible, Ciupala’s algorithm does not work, but our algorithm presents some information that helps to repair the infeasible network.
    Źródło:
    Control and Cybernetics; 2014, 43, 1; 79-94
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Efficient heuristic for non-linear transportation problem on the route with multiple ports
    Autorzy:
    Krile, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/260030.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
    Tematy:
    non-linear transportation problem
    Multi-destination Routing Problem
    Minimum Cost Multi-Commodity Flow Problem
    Capacity Management of Container Ships
    Opis:
    We need a better transport planning tool for loading maximization and transport cost minimization on the voyage route with multiple loading/unloading (discharging) ports. The implemented heuristic algorithm is able to find out an appropriate routing sequence with maximal earnings and profit. In the same time it looks for minimal loading/discharging and transshipment costs, but with fulfillment of cargo demands in a number of ports on the route. The efficient algorithm for optimal transport of N cargo loads (e.g. contingent of containers) for ships with limited capacity is being developed. This efficient tool may significantly reduce transport costs and ensure maximal profit to freight forwarders. Also, it can be applied for supply chain management of different goods from numerous vendors. The proposed algorithm shows acceptable complexity that means that such optimization tool can be used in shipping supported with limited computing power.
    Źródło:
    Polish Maritime Research; 2013, 4; 80-86
    1233-2585
    Pojawia się w:
    Polish Maritime Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies