Journal ArticleDOI
Visible light communication networks under ring and tree topology constraints
TLDR
This paper proposes new mixed integer linear programming (MILP) models in order to maximize the total capacity of a wireless visible light communication (VLC) network subject to power and ring and tree topology constraints.About:
This article is published in Computer Standards & Interfaces.The article was published on 2017-05-01. It has received 12 citations till now. The article focuses on the topics: Spanning tree & Tree (data structure).read more
Citations
More filters
Journal ArticleDOI
p-Median based formulations with backbone facility locations
TL;DR: New mixed integer linear programming models for the p-Median problem subject to ring, tree and star backbone topology constraints on the facility locations are proposed and variable neighborhood search (VNS) meta-heuristic algorithms are proposed, one for each topology.
Posted Content
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
TL;DR: The Steiner Traveling Salesman Problem (STSPP) is a variant of the TSP that is particularly suitable when dealing with sparse networks, such as road networks.
Journal ArticleDOI
Optimal sub-tree scheduling for wireless sensor networks with partial coverage
TL;DR: This paper proposes Kruskal-based variable neighborhood search (VNS) and simulated annealing (SA) meta-heuristic procedures to solve the problem of scheduling optimal sub-trees at different time intervals for wireless sensor network (WSN) communications with partial coverage.
Journal ArticleDOI
Modeling and Analysis for Modulation of Light-Conversion Materials in Visible Light Communication
TL;DR: This work proposed low-pass filter based models of light-conversion materials of YAG:Ce phosphor and CdSe/ZnS quantum dots, to build the relationship between fluorescence lifetime of these light- Conversion materials and their modulation bandwidth, and obtained the modulation bandwidth of light source with polychromatic light.
Journal ArticleDOI
Facility Location with Tree Topology and Radial Distance Constraints
TL;DR: This paper minimize the total connection cost distances between a set of customers and a subset of facility nodes and among facilities in S, subject to the condition that nodes in S simultaneously form a spanning tree and an independent set according to graphs and, respectively, where is the complement of .
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
The Price of Robustness
Dimitris Bertsimas,Melvyn Sim +1 more
TL;DR: In this paper, the authors propose an approach that attempts to make this trade-off more attractive by flexibly adjusting the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations.
The price of the robustness
D Bertsimas,M Sim +1 more
TL;DR: An approach is proposed that flexibly adjust the level of conservatism of the robust solutions in terms of probabilistic bounds of constraint violations, and an attractive aspect of this method is that the new robust formulation is also a linear optimization problem, so it naturally extend to discrete optimization problems in a tractable way.
Book
Introduction to Algorithms, third edition
TL;DR: Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book a great resource on the basic tools used to analyze the performance of algorithms.