NDLI: Solving the steiner tree problem with revenues, budget and hop constraints to optimality

Content Provider	IEEE Xplore Digital Library
Author	Layeb, S.B. Hajri, I. Haouari, M.
Copyright Year	2013
Description	Author affiliation: ROI, Combinatorial Optimization Res. Group, Ecole Polytech. de Tunisie, La Marsa, Tunisia (Layeb, S.B.; Hajri, I.; Haouari, M.)
Abstract	We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well as a preset budget and hop, the STPRBH seeks to find a subtree that includes the root node and maximizes the sum of the total edge revenues respecting the budget and hop constraints. These constraints impose limits on the total cost of the network and the number of edges between any vertex and the root. Not surprisingly, the STPRBH is NP-hard. For this challenging network design problem that arises in telecommunication settings and multicast routing, we present several polynomial size formulations. We propose an enhanced formulation based on the classical work of Miller, Tucker, and Zemlin by using additional set of variables representing the rank-order of visiting the nodes. Also, we investigate a new formulation for the STPRBH by tailoring a partial rank-1 of the Reformulation-Linearization Technique. Extensive results are exhibited using a set of benchmark instances to compare the proposed formulations by using a general purpose MIP solver.
Sponsorship	IEEE Tunisia Sect.
Starting Page	1
Ending Page	4
File Size	204902
Page Count	4
File Format	PDF
ISBN	9781467358125
e-ISBN	9781467358149
DOI	10.1109/ICMSAO.2013.6552674
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-04-28
Publisher Place	Tunisia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Steiner trees MTZ subtour elimination constraints Reformulation-Linearization technique Steiner tree Benchmark testing Linear programming Communications technology Vectors Mixed Integer Programming Optimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Computational Study for the Steiner Tree Problem with Revenue, Budget and Hop Constraints

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints

Dynamic programming driven memetic search for the steiner tree problem with revenues, budget, and hop constraints (2015)

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (2006)

Branch-and-Price for the Steiner Tree Problem with Revenues , Budget and Hop Constraints

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints

A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints

Solving the steiner tree problem with revenues, budget and hop constraints to optimality

Similar Documents

A Computational Study for the Steiner Tree Problem with Revenue, Budget and Hop Constraints

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints

Dynamic programming driven memetic search for the steiner tree problem with revenues, budget, and hop constraints (2015)

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (2006)

Branch-and-Price for the Steiner Tree Problem with Revenues , Budget and Hop Constraints

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints

A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints

Solving the steiner tree problem with revenues, budget and hop constraints to optimality