Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
The hop-constrained minimum spanning tree problem (HMSTP) is an NP-hard problem
arising in the design of centralized telecommunication networks with quality of service …
arising in the design of centralized telecommunication networks with quality of service …
Container shipping service selection and cargo routing with transshipment limits
A Balakrishnan, CV Karsten - European Journal of Operational Research, 2017 - Elsevier
We address the tactical planning problem faced by container liner shipping companies to
select a set of sailing services from a given pool of candidate services and route available …
select a set of sailing services from a given pool of candidate services and route available …
Optimization of multicast traffic in elastic optical networks with distance-adaptive transmission
In this letter, we propose three new approaches to optimizing multicast traffic in elastic
optical networks that implement distance-adaptive transmission. Two of the approaches are …
optical networks that implement distance-adaptive transmission. Two of the approaches are …
Optimal relay node placement in delay constrained wireless sensor network design
A Nigam, YK Agarwal - European Journal of Operational Research, 2014 - Elsevier
Abstract The Delay Constrained Relay Node Placement Problem (DCRNPP) frequently
arises in the Wireless Sensor Network (WSN) design. In WSN, Sensor Nodes are placed …
arises in the Wireless Sensor Network (WSN) design. In WSN, Sensor Nodes are placed …
Zigbee technology and device design
S Ondrej, B Zdenek, F Petr… - … Conference on Systems …, 2006 - ieeexplore.ieee.org
The wireless communication technologies are rapidly spreading to many new areas,
including the automation and the importance of the use of wireless technologies in the data …
including the automation and the importance of the use of wireless technologies in the data …
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
AM Costa, JF Cordeau… - Networks: An International …, 2009 - Wiley Online Library
The Steiner tree problem with revenues, budget and hop constraints is a variant of the
Steiner tree problem with two main modifications:(a) besides the costs associated with arcs …
Steiner tree problem with two main modifications:(a) besides the costs associated with arcs …
Optimal network design with end-to-end service requirements
A Balakrishnan, G Li, P Mirchandani - Operations Research, 2017 - pubsonline.informs.org
Long-term planning for transportation, telecommunications, and other service operations
entails designing networks that are both cost effective and responsive. Because …
entails designing networks that are both cost effective and responsive. Because …
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained
minimum spanning tree problem which is defined as follows: given a graph G=(V, E) with …
minimum spanning tree problem which is defined as follows: given a graph G=(V, E) with …
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
In this paper we study Integer Linear Programming models and develop branch-and-cut
algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP)(Bourgeois …
algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP)(Bourgeois …
Two-layer optimization of survivable overlay multicasting in elastic optical networks
Elastic optical network (EON) architectures are considered as a very promising approach for
future optical transport networks, since they efficiently use the spectrum resources and …
future optical transport networks, since they efficiently use the spectrum resources and …