Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

QR Code

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

In Indonesia, the fund for a project or an activity is usually divided into terms which can be two or three terms. Therefore, in order to optimize the utility, the team of the project need to design the project so that the project can be used as soon as possible without violating the restriction giv...

Full description

Bibliographic Details
Main Authors:	Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad
Format:	Article
Language:	English
Published:	Asian Research Publishing Network (ARPN) 2015
Subjects:	QA Mathematics
Online Access:	http://irep.iium.edu.my/46124/ http://irep.iium.edu.my/46124/1/Wamiliana_ARPN_November_2015.pdf

Similar Items

Ant Colony Optimization approaches to the degree-constrained minimum spanning tree problem
by: Bau, Yoon Teck, et al.
Published: (2008)

An ant colony optimization approach to the degree-constrained minimum spanning tree problem
by: Ewe, HT, et al.
Published: (2005)

Adaptive minimum error least significant bit replacement method for steganography using JPG/JPEG and PNG files
by: Wamiliana, Wamiliana, et al.
Published: (2015)

Determining the pattern for 1- fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k)
by: Wamiliana, Wamiliana, et al.
Published: (2015)

Statistical model and prediction of pineapple plant weight
by: Usman, Mustofa, et al.
Published: (2015)

Irregular total labeling on complete bipartite graph and union complete bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2010)

Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms
by: Mohd Ariffin, Mohd Khairol Anuar, et al.
Published: (2015)

A minimum spanning tree stock market analysis of Malaysia technology companies
by: Puteri Nur Qistina Megat Zulrushdi,, et al.
Published: (2024)

Outlier detection in circular regression model using minimum spanning tree method
by: Nur Faraidah, Muhammad Di, et al.
Published: (2019)

Outlier detection in circular regression model using minimum spanning tree method
by: Nur Faraidah, Muhammad Di, et al.
Published: (2019)

A minimum spanning tree stock market analysis of Malaysia technology companies
by: Zulrushdi, Puteri Nur Qistina Megat, et al.
Published: (2024)

Interval elimination method for stochastic spanning tree problem
by: Mohd, Ismail
Published: (1994)

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
by: Tan, Su Wei, et al.
Published: (2002)

Network analysis of shariah-compliant stocks on Bursa Malaysia by using minimum spanning tree (MST)
by: Mahamood, Fatin Nur Amirah, et al.
Published: (2019)

Analysing Malaysian technology sector during COVID-19: a minimum spanning tree approach
by: Bahaludin, Hafizah, et al.
Published: (2024)

Greedy heuristic for the workforce scheduling and routing problem
by: Russell, Samuel
Published: (2017)

Transformation of constrained model into unconstrained model in two way treatment structure with interaction
by: Daoud, Jamal Ibrahim, et al.
Published: (2006)

Restricted spanning trees and graph partitioning.
by: Lam, Bee K.
Published: (1999)

Parametric Cox’s Model for partly interval-censored data with application to AIDS studies
by: Elfaki, Faiz Ahmed Mohamed, et al.
Published: (2012)

Statistics for solving environmental problems
by: Elfaki, Faiz Ahmed Mohamed, et al.
Published: (2013)

Markov chains analysis and mechanism of migration in Indonesia in the period 1980-2010
by: Usman, Mustofa, et al.
Published: (2015)

A quantum algorithm for minimal spanning tree
by: Aghaei, Mohammad Reza Soltan, et al.
Published: (2008)

Multidimensional minimal spanning tree: the bursa Malaysia
by: Lim San Yee, San Yee, et al.
Published: (2018)

Greedy feature construction
by: Oglic, Dino, et al.
Published: (2016)

Minimal spanning tree for 100 companies in Bursa Malaysia
by: Bahaludin, Hafizah, et al.
Published: (2015)

Minimal spanning tree for 100 companies in Bursa Malaysia
by: Bahaludin, Hafizah, et al.
Published: (2014)

Survival model for partly interval-censored data with application to anti D in rhesus D negative studies
by: Elfaki, Faiz Ahmed Mohamed, et al.
Published: (2013)

Survival model for partly interval-censored data with application to anti D in rhesus D negative studies
by: Elfaki, Faiz Ahmed Mohamed, et al.
Published: (2013)

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2018)

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems
by: Qu, Rong, et al.
Published: (2013)

Comparison of some methods of testing hypothesis in unbalanced split plot design
by: Usman, Mustofa, et al.
Published: (2006)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Comparison of some methods of testing hypothesis in unbalanced split plot design
by: Usman, Mustofa, et al.
Published: (2006)

Anthracnose and related problems in some local fruit trees.
by: Lim, T.K.
Published: (1980)

Maximum and minimum degree energy of commuting graph for dihedral groups
by: Romdhini, Mamika Ujianita, et al.
Published: (2022)

Maximum and minimum degree energy of commuting graph for dihedral groups
by: Romdhini, Mamika Ujianita, et al.
Published: (2022)

Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
by: Arezoumand, Reza
Published: (2015)

The investigation on the impact of financial crisis on Bursa Malaysia using minimal spanning tree
by: Bahaludin, Hafizah, et al.
Published: (2019)

The investigation on the impact of financial crisis on Bursa Malaysia using minimal spanning tree
by: Bahaludin, Hafizah, et al.
Published: (2019)