Minimal Steiner tree problem [1] is to find a tree to feed all demand nodes by passing through some of the Steiner nodes (i.e. transshipment nodes) with the least cost. In this paper, power distribution system optimization problems, for example, reconfiguration and planning, are modeled as ...
trees (mathematics)/ stochastic spanning tree problemedge costsrandom variableschance constraintdecision variableparametric approachcomplexity orderThis paper considers a generalized version of the stochastic spanning tree problem in which edge costs are random variables and the objective is to find a ...
We consider now some other network optimization problems, in which the objective is to compute a shortest path, cycle, tree, or other graph, subject to various types of constraints. We focus primarily on two classes of problems: those of finding minimum-cost trees or tours that span some or...
The mcMST package for the R programming language contains several methods for solving the multi-criteria spanning tree problem (mcMST).Key features of the mcMST package are:A multi-objective version of Prim's algorithm. Evolutionary multi-objective algorithms (based on the Prüfer-encoding or ...
86 nonzeros 0s Objective function is integral with scale 1 Solving MIP model with: 22 rows 18 cols (18 binary, 0 integer, 0 implied int., 0 continuous) 86 nonzeros Nodes | B&B Tree | Objective Bounds | Dynamic Constraints | Work Proc. InQueue | Leaves Expl. | BestBound BestSol Ga...
We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2 ln (δ ...
It is possible to solve the variant with a maximization objective (items have profits) by setting the cost of assigning item anjto agent anitomaximum profit of item j - profit of assigning item j to agent i. It is possible to solve the variant where not all items have to be assigned by...
Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least d. This probl...
where the inequalities g(x)≥b and x≥0 are the constraints that specify a convex polytope over which the objective function c(x) is to be minimized, and f is the finite set of feasible solutions x that satisfy the constraints. There are many real-life problems (e.g., vehicle routing...
Minimum spanning tree problem (MSTP) has allured many researchers and practitioners due to its varied range of applications in real world scenarios. Modelling these applications involves the incorporation of indeterminate phenomena based on their subject