Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  networks
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Algorithm for turnpike policies in the dynamic lot size model

100%
Bylka S.
Applicationes Mathematicae
|
1996-1997
|
tom 24
|
nr 1
57-75
EN
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine an optimal infinite inverse policy and a strong turnpike policy relative to the class of standard or batch ordering type policies. Some remarks on the existence of planning and forecast horizons are also given.
2
Content available remote

Some minimization problems for planar networks of elastic curves

100%
Dall’Acqua A., Pluda A.
Geometric Flows
|
2017
|
tom 2
|
nr 1
EN
In this note we announce some results that will appear in [6] on the minimization of the functional F(Γ) = ∫Γk2 + 1 ds, where Γ is a network of three curves with fixed equal angles at the two junctions. The informal description of the results is accompanied by a partial review of the theory of elasticae and a diffuse discussion about the onset of interesting variants of the original problem passing from curves to networks. The considered energy functional F is given by the elastic energy and a term that penalize the total length of the network.We will show that penalizing the length is tantamount to fix it. The paper is concluded with the explicit computation of the penalized elastic energy of the “Figure Eight”, namely the unique closed elastica with self-intersections (see Figure 1).
3
Content available remote

The Median Problem on k-Partite Graphs

88%
Pravas K., Vijayakumar A.
Discussiones Mathematicae Graph Theory
|
2015
|
tom 35
|
nr 3
439-446
EN
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipartite graphs play a significant role in designing very large interconnection networks. In this paper, we answer a problem on the structure of medians of bipartite graphs by showing that any bipartite graph is the median (or anti-median) of another bipartite graph. Also, with a different construction, we show that the similar results hold for k-partite graphs, k ≥ 3. In addition, we provide constructions to embed another graph as center in both bipartite and k-partite cases. Since any graph is a k-partite graph, for some k, these constructions can be applied in general
4
Content available remote

Set membership estimation of parameters and variables in dynamic networks by recursive algorithms with a moving measurement window

88%
Duzinkiewicz K.
International Journal of Applied Mathematics and Computer Science
|
2006
|
tom 16
|
nr 2
209-217
EN
The paper considers a set membership joint estimation of variables and parameters in complex dynamic networks based on parametric uncertain models and limited hard measurements. A recursive estimation algorithm with a moving measurement window is derived that is suitable for on-line network monitoring. The window allows stabilising the classic recursive estimation algorithm and significantly improves estimate tightness. The estimator is validated on a case study regarding a water distribution network. Tight set estimates of unmeasured pipe flows, nodal heads, tank level and pipe resistances are obtained.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.