Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
M. Held and R. M. Karp, “The Travelling Salesman Prob lem and Minimum Spanning Trees,” Operations Re search, Vol. 18, No. 6, 1970, pp. 1138-1162. doi:10.1287/opre.18.6.1138
has been cited by the following article:
TITLE: Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution
AUTHORS: Eiman Jadaan Alenezy, Rehab F. Khalaf
KEYWORDS: Capacitated Facility Location Problem; Lagrangean Relaxation Technique; Volume Algorithm;Randomised Rounding Technique; Unit Cost Technique
JOURNAL NAME: Applied Mathematics, Vol.4 No.8, July 30, 2013
ABSTRACT: In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.
Related Articles:
Bifurcations of Travelling Wave Solutions for the B(m,n) Equation
Minzhi Wei, Yujian Gan, Shengqiang Tang
DOI: 10.4236/ajcm.2014.42010 3,187 Downloads 4,517 Views Citations
Pub. Date: March 25, 2014
Minimum Diameter Spanning Tree
V. T. Chandrasekaran, N. Rajasri
DOI: 10.4236/ajcm.2018.83016 613 Downloads 1,505 Views Citations
Pub. Date: September 7, 2018
The Design of the Minimum Spanning Tree Algorithms
Zhicheng LIU, Bo JIANG
DOI: 10.4236/iim.2009.11010 6,486 Downloads 10,497 Views Citations
Pub. Date: July 31, 2009
An M > 6 Earthquake ~750 BC in SE Sweden
Nils-Axel Mörner
DOI: 10.4236/ojer.2014.32008 3,784 Downloads 5,324 Views Citations
Pub. Date: May 29, 2014
Evapotranspiration and Above Ground Biomass of Acer rubrum from Liners to 8 m Tall Trees
Richard C. Beeson Jr.
DOI: 10.4236/ajps.2016.717213 1,126 Downloads 1,593 Views Citations
Pub. Date: December 13, 2016
