Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
In this work, we propose a procedure to compute Pareto-optimal fronts for the bi-objective
Minimum Diameter-Cost Spanning Tree problem (bi-MDCST). The bi-MDCST aims at …
Minimum Diameter-Cost Spanning Tree problem (bi-MDCST). The bi-MDCST aims at …
Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
The bi-objective minimum diameter-cost spanning tree problem (bi-MDCST) seeks spanning
trees with minimum total cost and minimum diameter. The bi-objective version generalizes …
trees with minimum total cost and minimum diameter. The bi-objective version generalizes …
An adaptive heuristic to the bounded-diameter minimum spanning tree problem
Given a graph G and a bound d≥ 2, the bounded-diameter minimum spanning tree problem
seeks a spanning tree on G of minimum weight subject to the constraint that its diameter …
seeks a spanning tree on G of minimum weight subject to the constraint that its diameter …
A stable virtual backbone for wireless MANETS
Due to the highly dynamicity and absence of a fixed infrastructure in wireless mobile ad hoc
networks (MANET), formation of a stable virtual backbone through which all the network …
networks (MANET), formation of a stable virtual backbone through which all the network …
Diameter-Constrained Minimum Spanning Tree Problems: A Survey
The diameter of a tree is a measure of the longest path between any two nodes in the tree
where this path is defined in terms of the number of edges. A Diameter-Constrained …
where this path is defined in terms of the number of edges. A Diameter-Constrained …
[PDF][PDF] Electricity distribution network design under changing demand patterns in modern electricity systems
A Schlüter - 2021 - freidok.uni-freiburg.de
This thesis develops a decision problem that integrates changing demand patterns into the
design of electricity distribution networks. Recent trends in the electricity sector change the …
design of electricity distribution networks. Recent trends in the electricity sector change the …
Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems
We consider the diameter constrained minimum Steiner tree problem on a graph (DCStTP).
Given an edge-weighted undirected graph whose set of nodes is partitioned into a set of …
Given an edge-weighted undirected graph whose set of nodes is partitioned into a set of …
New heuristic approaches for the bounded-diameter minimum spanning tree problem
W Steitz - INFORMS Journal on Computing, 2015 - pubsonline.informs.org
Given a bound, the bounded-diameter minimum spanning tree (BDMST) problem seeks a
spanning tree of minimum total weight with a diameter not exceeding the given diameter …
spanning tree of minimum total weight with a diameter not exceeding the given diameter …
[PDF][PDF] Trees and Forests.
Trees and forests have been a fascinating research topic in Operations Research
(OR)/Management Science (MS) throughout the years because they are involved in …
(OR)/Management Science (MS) throughout the years because they are involved in …
A learning automata based approach to the bounded-diameter minimum spanning tree problem
The bounded diameter minimum spanning tree (BDMST) problem aims at finding the
minimum weight spanning tree subject to a predefined diameter constraint. Due to the NP …
minimum weight spanning tree subject to a predefined diameter constraint. Due to the NP …