Chen, Si

Ljubic, Ivana

Raghavan, S.

Digital Repository at the University of Maryland

The InsTITuTe for sysTems researchIsr develops, applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and dynamic prob-lems of engineering technology and systems for industry and government.Isr is a permanent institute of the university of maryland, within the  a. James clark school of engineering. It is a graduated national science foundation engineering research center.www.isr.umd.eduInstances for the Generalized Regenerator Location ProblemSi ChenIvana LjubicS. RaghavanIsr TechnIcal rePorT 2015-3Instances for the Generalized Regenerator Location ProblemSi Chen∗ Ivana Ljubić† S. Raghavan‡∗College of Business and Public AffairsMurray State University, Murray, KY 42071, USAsi.chen@murraystate.edu†Department of Statistics and Operations ResearchUniversity of Vienna, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austriaivana.ljubic@univie.ac.at‡Robert H. Smith School of Business & Institute for Systems ResearchUniversity of Maryland, College Park, MD 20742, USAraghavan@umd.eduAbstractWe provide the instances used in the paper The Generalized Regenerator Location Prob-lem , by S. Chen, I. Ljubić and S. Raghavan, INFORMS J. on Computing, 27(2): 204–220, 2015(http://dx.doi.org/10.1287/ijoc.2014.0621). This repository contains both the instances used inthe paper as well as the upper and lower bounds obtained in the paper.The accompanying data is contained in the following files:• instancesgrlp.zip: In this compressed archive all the instances used in the paper (Set1,Set2, Set3) are provided. These instances do not have any preprocessing procedures appliedto them (as described Section 3.1 of [1]). They are in a format suitable for the branch-and-cutapproach. In other words they are the instances after transformation to the extended directedgraph H̃ described in Section 3.3 of [1].• InstancesDescription.txt: This file contains the description of the data files for the in-stances.• GRLP BandC.xlsx: This spreadsheet reports the upper and lower bounds obtained in the paper.Each sheet in this file contains the following columns:– Name: Name of the instance.– LB: Lower bound.– UB: Upper bound.– Status: OPTIMAL or SUBOPTIMAL (if UB 6= LB).References[1] S. Chen, I. Ljubić, and S. Raghavan. The generalized regenerator location problem. INFORMSJournal on Computing, 27(2):204–220, 2015.1

Instances for the Generalized Regenerator Location Problem

https://drum.lib.umd.edu/bitstream/1903/16328/12/grlp_dataset.pdf

Instances for the Generalized Regenerator Location Problem

Abstract

Similar works

Full text

Available Versions

Digital Repository at the University of Maryland