Browsing Master Theses by Title

Now showing items 1-10 of 410

    • 2-Eksponen dari Digraph Dwiwarna Asimetrik yang memuat Cycle Primitif 

      Ngatmintarsih, Titik (Universitas Sumatera Utara, 2008)
      Suatu digraph dwiwarna adalah sebuah digraph dengan setiap arcnya terwarnai,merah atau biru. Sebuah digraph dwiwarna D dikatakan terhubung kuat bila ada bilangan tak negatif h dan k sehingga untuk setiap pasangan verteks ...

    • Algoritma Branch and Cut untuk Program Stokastik Biner Campuran 

      Ardiana, Nunik (Universitas Sumatera Utara, 2011)
      Decomposition has proved to be one of the more effective tools for the solution of large-scale problems, especially those arising in stochastic programming.A decom position method with wide applicability is Benders ...

    • Algoritma Eksak untuk Menyelesaikan Persoalan Bin Covering 

      Saputra, Eri (Universitas Sumatera Utara, 2012)
      ABSTRACT This tesis present an exact algorithm for solving the problems of bin covering. Us- ing the branch and bound procedures and the technique of column generation. In the problem of integer programming, column ...

    • Algoritma Heuristik untuk Menyelesaikan Masalah Lintasan Terpendek Stokastik 

      Azis, Zainal (Universitas Sumatera Utara, 2008)
      In this thesis, we study the shortest path problem with stochastic arc length. According to different decision criteria, propoced the concepts of expected shortest path, shortest path and the most shortest path, and present ...

    • Algoritma Interior Point untuk Menyelesaikan Program Integer 

      Taruna, Satriawan (Universitas Sumatera Utara, 2011)
      TBranch-and-bound is a method of solving an program integer problem by solving a sequence of linear programming problems. The subproblems can be regarded as forming a tree, rooted at the linear programming relaxation of ...

    • Algoritma Particle Swarm Optimization (PSO) pada Penaksiran Parameter Distribusi Rayleigh 

      Lestari, Sutik (Universitas Sumatera Utara, 2021)
      The PSO algorithm is a global optimization method with population-based com- putational intelligence and techniques that is not much influenced by size and non-linear problems. The PSO algorithm can also avoid complicated ...

    • Algoritma Untuk Persoalan Lokasi Routing Berkendala 

      M, Imelda (Universitas Sumatera Utara, 2013)
      The logistic system of a firm with purchasing materials, controls work in process in each production phase, through the distribution management, it controls the flow of the products delivered to the customer, defines the ...

    • Analisis Algoritma Branch and Cut untuk Menyelesaikan Persoalan Program Integer Kuadrat 

      Gea, Petrus (Universitas Sumatera Utara, 2016)
      A mathematical programming model quadratic objective function and linear constraints with integer valued decision variables are often known as quadratic integer programming. Quadratic integer programming can solve many ...

    • Analisis Derivatif untuk Fungsi Tak Mulus 

      Suprayitno, Suprayitno (Universitas Sumatera Utara, 2007)
      Piecewise smooth function is a wellknown illustration of the semismooth function. The set of nonsmooth points of piecewise smooth function f partition the space locally into many related components. This thesis also ...

    • Analisis Efektivitas Didaktis terhadap Definisi Matematika pada Kasus Nilai Absolut 

      Jalil, Abdul (Universitas Sumatera Utara, 2011)
      Quite often a mathematical object may be introduced by a set of equivalent definitions. A fundamental question is determining the ”didactic effectiveness” of the techniques for solving a kind of problem associated with ...