Auflistung nach Titel

Anzeige der Dokumente 3972-3991 von 5099

REMARQUE SUR LES ZEROS DES INTEGRALES DE LAPLACE-ABEL

Petrović, Mihailo (Cracovie: Imprimerie de l'Universite , 1937)

[more]

[less]

URI: http://hdl.handle.net/123456789/4554

Dateien zu dieser Ressource: 1

REMARQUE SUR LES ZEROS DES INTEGRALES.pdf ( 847.4Kb )
REPARACIONI UGOVORI MILANA NEDELJKOVIĆA

Radovanac, Milan (Astr. druš. "Rudjer Bošković" , 2011)

[more]

[less]

URI: http://hdl.handle.net/123456789/1632

Dateien zu dieser Ressource: 1

02.pdf ( 581.5Kb )
REPETITORIJ DIFERENCIJALNOGA I INTEGRALNOGA RAČUNA

Kiseljak, Marija (Zagreb , 1925)

[more]

[less]

URI: http://hdl.handle.net/123456789/3702

Dateien zu dieser Ressource: 1

rFs.pdf ( 8.493Mb )
REPETITORIJ SREDNJOŠKOLSKE MATEMATIKE

Katalinić, Marin (Velika Kikinda , 1926)

[more]

[less]

URI: http://hdl.handle.net/123456789/2447

Dateien zu dieser Ressource: 1

repet FR.pdf ( 18.71Mb )
Reprezentacije grupa

Stojčić, Petar (Beograd , 2012)

[more]

[less]

URI: http://hdl.handle.net/123456789/4904

Dateien zu dieser Ressource: 1

rad.pdf ( 441.1Kb )
Reproduktivna rešenja jednačina

Banković, Dragić (Belgrade , 1980)

[more]

[less]

URI: http://hdl.handle.net/123456789/323

Dateien zu dieser Ressource: 1

phdDragicBankovic.pdf ( 3.550Mb )
REPUBLIČKI SEMINAR 2003

Više autora (Niš , 2003)

[more]

[less]

URI: http://hdl.handle.net/123456789/3878

Dateien zu dieser Ressource: 1

seminar_2003.PDF ( 431.3Kb )
Rešavanje diferencijalnih i diferencnih jednačina pomoću redova

Savić, Branko (Belgrade)

[more]

[less]

URI: http://hdl.handle.net/123456789/322

Dateien zu dieser Ressource: 1

phdBrankoSavic.pdf ( 1.082Mb )

REŠAVANJE DISKRETNIH LOKACIJSKIH PROBLEMA PRIMENOM METODE PROMENLJIVIH OKOLINA

Đenić, Aleksandar (Beograd , 2018)

[more]

Zusammenfassung:

This pap er considers two discrete lo cation problems: Bus Terminal Lo cation Problem (BTLP) and Long-term Care Facility Lo cation Problem (LTCFLP). Vari- able Neighb orho o d Search (VNS) metho d for solving BTLP and LTCFLP is pre- sented in this pap er. VNS is a single-solution based metaheuristic based on system- atic change of neighb orho o ds while searching for optimal solution of the problem. It consists two main phases: shake phase and lo cal search phase. BTLP is a discrete lo cation problem which considers lo cating bus terminals in order to provide the highest p ossible quality of public service to the clients. Clients are presented as public transp ortation stations, such as bus or metro stations. VNS algorithm is used for solving BTLP. This algorithm uses improved lo cal search based on e cient neighb orho o d interchange. VNS is parallelized (PVNS) which leads to signi cant time improvement in function of the pro cessor core count. Computa- tional results show that prop osed PVNS metho d improves existing results from the literature in terms of quality. Larger instances, based on instances from the Trav- eling Salesman Problem library, are presented and computational results for those instances are rep orted. LTCFLP is created as a part of health care infrastructure planning in South Korea. Clients are considered as groups of patients with a need of long-term health care, while established facilities present lo cations where the centers that provide health care services should b e built. Prede ned are n lo cations where centers are to b e established. This problem seeks at most K lo cations to establish health centers so they are to b e equally loaded with clients demand. For solving LTCFLP, by using VNS algorithm, data structure based on fast interchange is presented. It reduces the time complexity of one iteration of lo cal search algorithm to O ( n · max( n,K 2 )) comparing to the known time complexity from the literature O ( K 2 · n 2 ) . Reduced time complexity of the presented VNS leads to b etter quality solutions, due to larger numb er of VNS iterations that can b e p erformed in less computational time. This pap er presents computational results that outp erform the b est known results from the literature.

URI:

http://hdl.handle.net/123456789/4744

Dateien zu dieser Ressource: 1

Aleksandar_Djenic_phd.pdf ( 2.183Mb )

Rešavanje dvostepenog problema instalacije neograničenih kapaciteta primenom genetskog algoritma

Mišković, Stefan (MATEMATIČKI FAKULTET UNIVERZITETA U BEOGRADU , 2010)

[more]

[less]

URI: http://hdl.handle.net/123456789/1828

Dateien zu dieser Ressource: 1

Master rad.pdf ( 1.845Mb )
Rešavanje enumerativnih problema pomoću dejstva grupa

Popović, Mirka (Beograd , 2018)

[more]

[less]

URI: http://hdl.handle.net/123456789/4695

Dateien zu dieser Ressource: 1

masterPopovicMirka.pdf ( 702.4Kb )
Rešavanje enumerativnih problema pomoću dejstva grupa

Popović, Mirka (Beograd , 2018)

[more]

[less]

URI: http://hdl.handle.net/123456789/4686

Dateien zu dieser Ressource: 1

masterPopovicMirka.pdf ( 702.4Kb )
REŠAVANJE GRANIČNOG PROBLEMA SA KAPUTOVIM IZVODOM RAZLOMLJENOG REDA METODAMA KONAČNIH RAZLIKA I KOLOKACIJE

Šaponjić, Dragana (Beograd , 2017)

[more]

[less]

URI: http://hdl.handle.net/123456789/4674

Dateien zu dieser Ressource: 1

masSaponjicDragana.pdf ( 589.3Kb )
Rešavanje jednačina kretanja stohastičkom simulacijom

Pantić, Dražen (Belgrade)

[more]

[less]

URI: http://hdl.handle.net/123456789/44

Dateien zu dieser Ressource: 1

Pantic.pdf ( 1.585Mb )
Rešavanje jednačina trećeg i četvrtog stepena korišćenjem cirkularnih matrica

Jovanović, Ivana (Beograd , 2019)

[more]

[less]

URI: http://hdl.handle.net/123456789/4793

Dateien zu dieser Ressource: 1

masJovanovic_Ivana.pdf ( 315.5Kb )
Rešavanje jednodimenzionog problema pakovanja kombinovanjem optimizacionih metoda

Rajačić, Jasna (Beograd , 2013)

[more]

[less]

URI: http://hdl.handle.net/123456789/4887

Dateien zu dieser Ressource: 1

RajacicJasna.pdf ( 1.849Mb )
Rešavanje klase agebarskih zadataka i opšta heuristička pravila

Nešić, Ivana (Beograd , 2014)

[more]

[less]

URI: http://hdl.handle.net/123456789/3899

Dateien zu dieser Ressource: 1

masterIvanaNesic.pdf ( 1.075Mb )

REŠAVANJE KLASE MIN-MAX PROBLEMA ROBUSNE DISKRETNE OPTIMIZACIJE SA PRIMENAMA

Mišković, Stefan (Beograd , 2016)

[more]

Zusammenfassung:

In this dissertation, three NP-hard min-max discrete optimization problems are considered. The rst considered problem is multi-period emergency service location problem, the second one is dynamic maximal covering location problem with multiple covering radii, and the third one is uncapacitated multiple allocation p-hub center problem. In many practical situations, input parameters (such as user demands, transportation time or cost) often vary with unknown distributions. Therefore, it is necessary to involve these uncertainties in the deterministic variants of the problems by applying robust optimization approach. Mathematical models for the deterministic and non-deterministic variants of all three problems are developed, except for the deterministic uncapacitated multiple allocation p-hub center problem, which has already been addressed in the literature. In addition, for the rst time in the literature, it was proven that the emergency service location problem is NP-hard. The considered problems and their robust variants have numerous applications, due to the fact that in real-life situations input parameters are often subject to uncertainty. Multi-period emergency service location problem may be used when determining optimal locations for police stations, re brigades, ambulances, and other emergency units in the given region. The dynamic maximal covering location problem with multiple covering radii is useful when choosing the optimal strategy for establishing resources (service centers, suppliers, facilities, etc.) with maximal satisfaction of customer demands in a certain region, by assuming that the service e ciency directly depends on the distance between customer and service center (i.e., the selected coverage radius). The uncapacitated multiple allocation p-hub center problem has signi cant applications in designing telecommunication and transportation networks, postal delivery systems, emergency systems, supply networks, etc. Since exact methods provide optimal solutions only for problem instances of small dimensions, hybrid metaheuristic algorithms are developed to solve both deterministic and robust variants of the considered problems. The proposed hybrid algorithms are obtained by combining particle swarm optimization, with local search heuristic { classical local search or variable neighborhood search method. For dynamic maximal covering location problem with multiple covering radii, a hybridization of metaheuristic algorithm with exact method based on linear programming is developed. All elements of the proposed algorithms are adopted to the problems under consideration. Di erent strategies are implemented for improving the e ciency of proposed algorithms, especially for the calculation of the objective function value and the local search part. The in uence of di erent parameters of hybrid algorithms on the solution quality is analyzed in detail. All parameters are adjusted by using analysis of variance. For all considered problems (both deterministic and robust variant), the performance of the proposed hybrid algorithms is evaluated on adequate test data sets. The proposed algorithms are compared with existing heuristic from the literature and exact methods incorporated in commercial CPLEX solver. The obtained experimental results indicate the e ciency of proposed algorithms in obtaining high quality solutions for all considered test instances. The presented comparative analysis indicates the advantages of the proposed hybrid algorithms over existing methods in the sense of solution quality and/or required computational time, especially in the case of large problem dimensions. The results presented in this paper represent a contribution to the eld of discrete optimization, robust optimization and metaheuristic methods.

URI:

http://hdl.handle.net/123456789/4423

Dateien zu dieser Ressource: 1

Miskovic_Stefan_teza.pdf ( 1.773Mb )

Rešavanje kvadratnog problema pridruživanja primenom metode promenljivih okolina

Simić, Ana (Beograd , 2014)

[more]

[less]

URI: http://hdl.handle.net/123456789/3892

Dateien zu dieser Ressource: 1

masterAnaSimic.pdf ( 1.014Mb )
Rešavanje lokacijskog problema ograničenih kapaciteta sa modularnim vezama korišćenjem memetskog algoritma

Perić, Miloš (Beograd , 2015)

[more]

[less]

URI: http://hdl.handle.net/123456789/4283

Dateien zu dieser Ressource: 1

Peric_Milos.pdf ( 288.3Kb )

Vorherige Seite

Anzeige der Dokumente 3972-3991 von 5099

Nächste Seite

Auflistung nach Titel

eBibliothek Repositorium

Auflistung nach Titel

eBibliothek Suche

Stöbern

Gesamter Bestand

Mein Benutzerkonto

Relited sites

COPYRIGHT STATEMENT