Gotowa bibliografia na temat „Locational problems”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Locational problems”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Locational problems"
Okabe, Atsuyuki, i Atsuo Suzuki. "Locational optimization problems solved through Voronoi diagrams". European Journal of Operational Research 98, nr 3 (maj 1997): 445–56. http://dx.doi.org/10.1016/s0377-2217(97)80001-x.
Pełny tekst źródłaTellier, L. N. "From the Weber Problem to a ‘Topodynamic’ Approach to Locational Systems". Environment and Planning A: Economy and Space 24, nr 6 (czerwiec 1992): 793–806. http://dx.doi.org/10.1068/a240793.
Pełny tekst źródłaCromley, Ellen K. "LOCATIONAL PROBLEMS AND PREFERENCES IN PRESCHOOL CHILD CARE". Professional Geographer 39, nr 3 (sierpień 1987): 309–17. http://dx.doi.org/10.1111/j.0033-0124.1987.00309.x.
Pełny tekst źródłaDelorme, Xavier, Alexandre Dolgui i Alexander Kolokolov. "Complex Optimization Problems in Locational Analysis and Scheduling". Journal of Mathematical Modelling and Algorithms in Operations Research 12, nr 2 (1.08.2012): 101–3. http://dx.doi.org/10.1007/s10852-012-9197-1.
Pełny tekst źródłaCarrizosa, Emilio, i Frank Plastria. "Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints". Top 6, nr 2 (grudzień 1998): 179–94. http://dx.doi.org/10.1007/bf02564786.
Pełny tekst źródłaBarmish, B. Ross, i Tamer Basar. "Characterization and uniqueness of equilibria in locational choice problems". Mathematical Modelling 8 (1987): 664–69. http://dx.doi.org/10.1016/0270-0255(87)90665-8.
Pełny tekst źródłaScott, A. J. "OPTIMAL DECISION PROCESSES FOR A CLASS OF DYNAMIC LOCATIONAL PROBLEMS†". Papers in Regional Science 26, nr 1 (14.01.2005): 25–35. http://dx.doi.org/10.1111/j.1435-5597.1971.tb01490.x.
Pełny tekst źródłaPelegrin, B., i F. R. Fernandez. "Determination of efficient solutions for point-objective locational decision problems". Annals of Operations Research 18, nr 1 (grudzień 1989): 93–102. http://dx.doi.org/10.1007/bf02097797.
Pełny tekst źródłaWeckx, Sam, Reinhilde D'hulst i Johan Driesen. "Locational Pricing to Mitigate Voltage Problems Caused by High PV Penetration". Energies 8, nr 5 (21.05.2015): 4607–28. http://dx.doi.org/10.3390/en8054607.
Pełny tekst źródłaAllen, Ryan. "The Distribution and Evolution of Physical Neighborhood Problems during the Great Recession". City & Community 12, nr 3 (wrzesień 2013): 260–79. http://dx.doi.org/10.1111/cico.12025.
Pełny tekst źródłaRozprawy doktorskie na temat "Locational problems"
Chakraborti, Nisith Ranjan. "Solution of certain locational problems arising in L1 Norms". Thesis, University of North Bengal, 1994. http://hdl.handle.net/123456789/598.
Pełny tekst źródłaHussein, E. A. "Dual-based methods for some covering problems in locational analysis". Thesis, University of Liverpool, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356269.
Pełny tekst źródłaRoss, Kim A. "The locational history of Scotland's district lunatic asylums, 1857-1913". Thesis, University of Glasgow, 2014. http://theses.gla.ac.uk/5320/.
Pełny tekst źródłaDavies, Amanda Catherine. "A case of community safety : displacing complex ‘social’ problems in Fortitude Valley". Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/50961/1/Amanda_Davies_Thesis.pdf.
Pełny tekst źródłaThangavelu, Balajee. "Single-Facility location problem among two-dimensional existing facility locations". Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175283985.
Pełny tekst źródłaDias, Fábio Carlos Sousa. "Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica". reponame:Repositório Institucional da UFC, 2008. http://www.repositorio.ufc.br/handle/riufc/17871.
Pełny tekst źródłaSubmitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:13:52Z No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:16:23Z (GMT) No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Made available in DSpace on 2016-06-22T17:16:23Z (GMT). No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) Previous issue date: 2008
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to …nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between …xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to …nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e¢ ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Neste trabalho, estudamos o problema de localização simples (SPLP - Simple Plant Location Problem). Usando a formulação matemática clássica e uma outra formulação proposta recentemente, desenvolvemos vários algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulação clássica, tais limites são obtidos utilizando o método de correção de dados e critérios de dominância entre os custos …xos e de transporte. Propomos uma projeção dessa formulação, que se mostrou computacionalmente atrativa. Usando a nova formulação propomos e mostramos a corretude de vários procedimentos iterativos que procuram encontrar uma solução para o problema, resolvendo uma seqüência de subproblemas paramétricos obtidos com a remoção de variáveis e restrições da formulação original. Em cada iteração desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxação lagrangeana a essa nova formulação para obter outros limites. Analisamos várias possibilidades de relaxação das restrições. Desenvolmento também algoritmos branch-and-bound baseados em ambas as formulações e nos limites obtidos. Avaliamos a e…ciência computacional de todos os algoritmos com instâncias de teste difíceis, disponíveis na literatura. Resultados computacionais e comparações com outros algoritmos da literatura são reportados.
Dias, FÃbio Carlos Sousa. "Algoritmos para o problema de localizaÃÃo simples baseados nas formulaÃÃes clÃssica e canÃnica". Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2827.
Pełny tekst źródłaNeste trabalho, estudamos o problema de localizaÃÃo simples (SPLP - Simple Plant Location Problem). Usando a formulaÃÃo matemÃtica clÃssica e uma outra formulaÃÃo proposta recentemente, desenvolvemos vÃrios algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulaÃÃo clÃssica, tais limites sÃo obtidos utilizando o mÃtodo de correÃÃo de dados e critÃrios de dominÃncia entre os custos xos e de transporte. Propomos uma projeÃÃo dessa formulaÃÃo, que se mostrou computacionalmente atrativa. Usando a nova formulaÃÃo propomos e mostramos a corretude de vÃrios procedimentos iterativos que procuram encontrar uma soluÃÃo para o problema, resolvendo uma seqÃÃncia de subproblemas paramÃtricos obtidos com a remoÃÃo de variÃveis e restriÃÃes da formulaÃÃo original. Em cada iteraÃÃo desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxaÃÃo lagrangeana a essa nova formulaÃÃo para obter outros limites. Analisamos vÃrias possibilidades de relaxaÃÃo das restriÃÃes. Desenvolmento tambÃm algoritmos branch-and-bound baseados em ambas as formulaÃÃes e nos limites obtidos. Avaliamos a e ciÃncia computacional de todos os algoritmos com instÃncias de teste difÃceis, disponÃveis na literatura. Resultados computacionais e comparaÃÃes com outros algoritmos da literatura sÃo reportados.
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Wei, Hu. "SOLVING CONTINUOUS SPACE LOCATION PROBLEMS". The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.
Pełny tekst źródłaSan, Felice Mário César 1985. "Online facility location and Steiner problems = Problemas online de localização de instalações e de Steiner". [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275552.
Pełny tekst źródłaTese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-27T12:18:11Z (GMT). No. of bitstreams: 1 SanFelice_MarioCesar_D.pdf: 1457706 bytes, checksum: 4813f4ed44c52462656d56537d73d5dc (MD5) Previous issue date: 2015
Resumo: Nesta tese estudamos problemas online das famílias de localização de instalações e de Steiner, através da abordagem de análise competitiva. O objetivo nestes problemas é construir uma rede de custo mínimo para atender a uma determinada demanda. Nós apresentamos resultados conhecidos para o problema Online da Localização de Instalações (OFL), o problema Online da Árvore de Steiner (OST) e o problema Online Single-Source Rent-or-Buy (OSRoB). O OFL consiste em atender a um conjunto de clientes, através da abertura de algumas instalações e da conexão de cada cliente com uma instalação aberta. O OST tem por objetivo conectar um conjunto de terminais utilizando uma árvore, que pode conter vértices não terminais, chamados vértices de Steiner. O OSRoB é uma versão rent-or-buy do OST, onde todos os terminais devem ser conectados a um nó especial chamado raíz. Os algoritmos e técnicas que apresentamos para estes problemas são importantes no desenvolvimento dos nossos algoritmos para os problemas que consideramos. Apresentamos novos resultados para o problema Online da Localização de Instalações com Coleta de Prêmios (OPFL), o problema Online da Árvore Estrela de Steiner (OSTS), e o problema Online da Localização de Instalações Conectadas (OCFL). O OPFL é uma generalização do OFL, em que alguns clientes podem ficar desconectados mediante o pagamento de penalidades. O OSTS é uma variante do OST, em que os vértices possuem custos não negativos. O OCFL é uma combinação do OFL e do OST, em que um conjunto de clientes precisa ser atendido através da abertura de algumas instalações, da conexão de cada cliente com uma instalação aberta, e da construção de uma árvore, mais custosa, que conecta as instalações abertas
Abstract: In this thesis we study online problems from the facility location and Steiner families, through the point of view of competitive analysis. The goal in these problems is to build a minimum cost network to attend a certain demand. We present known results for the Online Facility Location problem (OFL), the Online Steiner Tree problem (OST) and the Online Single-Source Rent-or-Buy problem (OSRoB). The OFL consists of serving a set of clients by opening some facilities and by connecting each client to a facility. The OST aims to connect a set of terminals in order to create a tree network, that may contain nonterminals, called Steiner nodes. The OSRoB is a rent-or-buy version of the OST, in which all terminals must be connected to a special node called root. The algorithms and techniques that we present for these problems play an important role in the design of our algorithms for the problems we consider. We present new results for the Online Prize-Collecting Facility Location problem (OPFL), the Online Steiner Tree Star problem (OSTS), and the Online Connected Facility Location problem (OCFL). The OPFL is a generalization of the OFL, in which some clients may be left unconnected by paying a penalty. The OSTS is a variant of the OST, in which the nodes have non-negative costs. The OCFL is a combination of the OFL and the OST, in which a set of clients needs to be served by opening some facilities, by connecting each client to a facility, and by creating a more expensive tree network that connects the open facilities
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
Mazi, Abdullah Mazi E. "Combining heuristic and exact approach for the vertex p-centre problem and other related location problems". Thesis, University of Kent, 2010. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.544027.
Pełny tekst źródłaKsiążki na temat "Locational problems"
Stochastic queue location problems. [S.l: s.n.], 1991.
Znajdź pełny tekst źródłaH, Massam Bryan, i York University (Toronto, Ont.). Institute for Social Research., red. Complex location problems: Interdisciplinary approaches. [Downsview, Ont.]: Institute for Social Research, York University, 1988.
Znajdź pełny tekst źródłaEiselt, H. A., i Vladimir Marianov, red. Uncertainty in Facility Location Problems. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-32338-6.
Pełny tekst źródłaKlamroth, Kathrin. Single-Facility Location Problems with Barriers. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/b98843.
Pełny tekst źródłaChhajed, Dilip. Solving structured multifacility location problems efficiently. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1991.
Znajdź pełny tekst źródłaRosenfield, Donald B. The retailer facility location problem. Cambridge, Mass: Massachusetts Institute of Technology, 1985.
Znajdź pełny tekst źródłaWelch, Stephen Bernard. The obnoxious facility location problem. Birmingham: University of Birmingham, 1999.
Znajdź pełny tekst źródłaEiselt, H. A., i C. L. Sandblom. Decision Analysis, Location Models, and Scheduling Problems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24722-7.
Pełny tekst źródłaGlen, John J. The capacitated dynamic facilities location problem. Edinburgh: University of Edinburgh. Department of BusinessStudies, 1988.
Znajdź pełny tekst źródłaConcentrator location in telecommunications networks. New York: Springer, 2005.
Znajdź pełny tekst źródłaCzęści książek na temat "Locational problems"
Kuhn, Harold W. "Locational Problems And Mathematical Programming". W Mathematical Optimiation in Economics, 57–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11039-9_2.
Pełny tekst źródłaKalcsics, Jörg, i Roger Z. Ríos-Mercado. "Districting Problems". W Location Science, 705–43. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_25.
Pełny tekst źródłaKalcsics, Jörg. "Districting Problems". W Location Science, 595–622. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13111-5_23.
Pełny tekst źródłaCampbell, James F., Andreas T. Ernst i Mohan Krishnamoorthy. "Hub Location Problems". W Facility Location, 373–407. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56082-8_12.
Pełny tekst źródłaPlastria, Frank. "Continuous Location Problems". W Facility Location, 225–62. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_12.
Pełny tekst źródłaBerman, Oded, M. John Hodgson i Dmitry Krass. "Flow-Interception Problems". W Facility Location, 389–426. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_18.
Pełny tekst źródłaContreras, Ivan, i Morton O’Kelly. "Hub Location Problems". W Location Science, 327–63. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_12.
Pełny tekst źródłaMarín, Alfredo, i Mercedes Pelegrín. "p-Median Problems". W Location Science, 25–50. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_2.
Pełny tekst źródłaAlumur, Sibel A., i Tolga Bektaş. "Green Location Problems". W Location Science, 591–610. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_20.
Pełny tekst źródłaÇalık, Hatice, Martine Labbé i Hande Yaman. "p-Center Problems". W Location Science, 51–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_3.
Pełny tekst źródłaStreszczenia konferencji na temat "Locational problems"
Sharifi, Farid, Youmin Zhang i Brandon W. Gordon. "Voronoi-Based Coverage Control for Multi-Quadrotor UAVs". W ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48651.
Pełny tekst źródłaSrivastava, Amber, i Srinivasa M. Salapaka. "Robustness Analysis for Simultaneous Resource Allocation and Route Optimization Problems". W ASME 2017 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/dscc2017-5179.
Pełny tekst źródłaAlzorba, Shaghaf, i Christian Günther. "Algorithms for multicriteria location problems". W NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756650.
Pełny tekst źródłaManjunatha, Hemanth, Jida Huang, Binbin Zhang i Rahul Rai. "A Sequential Sampling Algorithm for Multi-Stage Static Coverage Problems". W ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60305.
Pełny tekst źródłaArghandeh, Reza, i Robert Broadwater. "Distributed Energy Storage Control for Optimal Adoption of Solar Energy in Residential Networks". W 2012 20th International Conference on Nuclear Engineering and the ASME 2012 Power Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/icone20-power2012-54940.
Pełny tekst źródłaLi, Zheng, Mo Yang i Yuwen Zhang. "Lattice Boltzmann Method Simulation of 3-D Melting Using Double MRT Model With Interfacial Tracking Method". W ASME 2016 Heat Transfer Summer Conference collocated with the ASME 2016 Fluids Engineering Division Summer Meeting and the ASME 2016 14th International Conference on Nanochannels, Microchannels, and Minichannels. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/ht2016-7407.
Pełny tekst źródłaAlizadeh, R., i T. Nishi. "Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem". W 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2019. http://dx.doi.org/10.1109/ieem44572.2019.8978601.
Pełny tekst źródłaGilbert, Jacob, MohammadTaghi Hajiaghayi, Hamed Saleh i Saeed Seddighin. "Location-Sensitive String Problems in MPC". W SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3558481.3591090.
Pełny tekst źródłaPlaxton, C. Greg. "Approximation algorithms for hierarchical location problems". W the thirty-fifth ACM symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/780542.780549.
Pełny tekst źródłaMakino, Kazuhisa. "Source Location Problems with Flow Requirements". W 2012 Third International Conference on Networking and Computing (ICNC). IEEE, 2012. http://dx.doi.org/10.1109/icnc.2012.77.
Pełny tekst źródłaRaporty organizacyjne na temat "Locational problems"
Schulzrinne, H., L. Liess, H. Tschofenig, B. Stark i A. Kuett. Location Hiding: Problem Statement and Requirements. RFC Editor, styczeń 2012. http://dx.doi.org/10.17487/rfc6444.
Pełny tekst źródłaKoodli, R. IP Address Location Privacy and Mobile IPv6: Problem Statement. RFC Editor, maj 2007. http://dx.doi.org/10.17487/rfc4882.
Pełny tekst źródłaTschofenig, H., i H. Schulzrinne. GEOPRIV Layer 7 Location Configuration Protocol: Problem Statement and Requirements. RFC Editor, marzec 2010. http://dx.doi.org/10.17487/rfc5687.
Pełny tekst źródłaAhrens, David L., Daniel B. Olsen i Azer P. Yalin. GRI-05-0138 Development of an Open Path Laser Ignition System for a Large Bore Natural. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), marzec 2005. http://dx.doi.org/10.55274/r0011965.
Pełny tekst źródłaPaul, Kylie, Jamie Faselt, Matthew Bell, Marcel P. Huijser, David Theobald, Annika Keeley i Robert Ament. West-Wide Study to Identify Important Highway Locations for Wildlife Crossings. Western Transportation Institute, 2023. http://dx.doi.org/10.15788/1706214520.
Pełny tekst źródłaRodi, William L. Error Analysis in the Joint Event Location/Seismic Calibration Inverse Problem. Fort Belvoir, VA: Defense Technical Information Center, luty 2008. http://dx.doi.org/10.21236/ada479709.
Pełny tekst źródłaBrian Harder i Chacko John. MISSING WELL LOCATIONS: AN ENVIRONMENTAL RISK ASSESSMENT AND REGULATORY PROBLEM FOR LOUISIANA. Office of Scientific and Technical Information (OSTI), kwiecień 2003. http://dx.doi.org/10.2172/820942.
Pełny tekst źródłaFourie i Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), kwiecień 2002. http://dx.doi.org/10.55274/r0010624.
Pełny tekst źródłaSloan, Steven, Shelby Peterie, Richard Miller, Julian Ivanov, J. Schwenk i Jason McKenna. Detecting clandestine tunnels by using near-surface seismic techniques. Engineer Research and Development Center (U.S.), kwiecień 2021. http://dx.doi.org/10.21079/11681/40419.
Pełny tekst źródłaMeloy, John D. L51702 Precision Gas Pipeline Location-A Technology Study. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), styczeń 1994. http://dx.doi.org/10.55274/r0010417.
Pełny tekst źródła