Littérature scientifique sur le sujet « Locational problems »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Locational problems ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Locational problems"
Okabe, Atsuyuki, et Atsuo Suzuki. « Locational optimization problems solved through Voronoi diagrams ». European Journal of Operational Research 98, no 3 (mai 1997) : 445–56. http://dx.doi.org/10.1016/s0377-2217(97)80001-x.
Texte intégralTellier, L. N. « From the Weber Problem to a ‘Topodynamic’ Approach to Locational Systems ». Environment and Planning A : Economy and Space 24, no 6 (juin 1992) : 793–806. http://dx.doi.org/10.1068/a240793.
Texte intégralCromley, Ellen K. « LOCATIONAL PROBLEMS AND PREFERENCES IN PRESCHOOL CHILD CARE ». Professional Geographer 39, no 3 (août 1987) : 309–17. http://dx.doi.org/10.1111/j.0033-0124.1987.00309.x.
Texte intégralDelorme, Xavier, Alexandre Dolgui et Alexander Kolokolov. « Complex Optimization Problems in Locational Analysis and Scheduling ». Journal of Mathematical Modelling and Algorithms in Operations Research 12, no 2 (1 août 2012) : 101–3. http://dx.doi.org/10.1007/s10852-012-9197-1.
Texte intégralCarrizosa, Emilio, et Frank Plastria. « Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints ». Top 6, no 2 (décembre 1998) : 179–94. http://dx.doi.org/10.1007/bf02564786.
Texte intégralBarmish, B. Ross, et 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.
Texte intégralScott, A. J. « OPTIMAL DECISION PROCESSES FOR A CLASS OF DYNAMIC LOCATIONAL PROBLEMS† ». Papers in Regional Science 26, no 1 (14 janvier 2005) : 25–35. http://dx.doi.org/10.1111/j.1435-5597.1971.tb01490.x.
Texte intégralPelegrin, B., et F. R. Fernandez. « Determination of efficient solutions for point-objective locational decision problems ». Annals of Operations Research 18, no 1 (décembre 1989) : 93–102. http://dx.doi.org/10.1007/bf02097797.
Texte intégralWeckx, Sam, Reinhilde D'hulst et Johan Driesen. « Locational Pricing to Mitigate Voltage Problems Caused by High PV Penetration ». Energies 8, no 5 (21 mai 2015) : 4607–28. http://dx.doi.org/10.3390/en8054607.
Texte intégralAllen, Ryan. « The Distribution and Evolution of Physical Neighborhood Problems during the Great Recession ». City & ; Community 12, no 3 (septembre 2013) : 260–79. http://dx.doi.org/10.1111/cico.12025.
Texte intégralThèses sur le sujet "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.
Texte intégralHussein, 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.
Texte intégralRoss, Kim A. « The locational history of Scotland's district lunatic asylums, 1857-1913 ». Thesis, University of Glasgow, 2014. http://theses.gla.ac.uk/5320/.
Texte intégralDavies, 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.
Texte intégralThangavelu, Balajee. « Single-Facility location problem among two-dimensional existing facility locations ». Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175283985.
Texte intégralDias, 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.
Texte intégralSubmitted 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.
Texte intégralNeste 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.
Texte intégralSan, 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.
Texte intégralTese (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.
Texte intégralLivres sur le sujet "Locational problems"
Stochastic queue location problems. [S.l : s.n.], 1991.
Trouver le texte intégralH, Massam Bryan, et York University (Toronto, Ont.). Institute for Social Research., dir. Complex location problems : Interdisciplinary approaches. [Downsview, Ont.] : Institute for Social Research, York University, 1988.
Trouver le texte intégralEiselt, H. A., et Vladimir Marianov, dir. Uncertainty in Facility Location Problems. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-32338-6.
Texte intégralKlamroth, Kathrin. Single-Facility Location Problems with Barriers. New York, NY : Springer New York, 2002. http://dx.doi.org/10.1007/b98843.
Texte intégralChhajed, Dilip. Solving structured multifacility location problems efficiently. [Urbana, Ill.] : College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1991.
Trouver le texte intégralRosenfield, Donald B. The retailer facility location problem. Cambridge, Mass : Massachusetts Institute of Technology, 1985.
Trouver le texte intégralWelch, Stephen Bernard. The obnoxious facility location problem. Birmingham : University of Birmingham, 1999.
Trouver le texte intégralEiselt, H. A., et 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.
Texte intégralGlen, John J. The capacitated dynamic facilities location problem. Edinburgh : University of Edinburgh. Department of BusinessStudies, 1988.
Trouver le texte intégralConcentrator location in telecommunications networks. New York : Springer, 2005.
Trouver le texte intégralChapitres de livres sur le sujet "Locational problems"
Kuhn, Harold W. « Locational Problems And Mathematical Programming ». Dans Mathematical Optimiation in Economics, 57–76. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11039-9_2.
Texte intégralKalcsics, Jörg, et Roger Z. Ríos-Mercado. « Districting Problems ». Dans Location Science, 705–43. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_25.
Texte intégralKalcsics, Jörg. « Districting Problems ». Dans Location Science, 595–622. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13111-5_23.
Texte intégralCampbell, James F., Andreas T. Ernst et Mohan Krishnamoorthy. « Hub Location Problems ». Dans Facility Location, 373–407. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56082-8_12.
Texte intégralPlastria, Frank. « Continuous Location Problems ». Dans Facility Location, 225–62. New York, NY : Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_12.
Texte intégralBerman, Oded, M. John Hodgson et Dmitry Krass. « Flow-Interception Problems ». Dans Facility Location, 389–426. New York, NY : Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_18.
Texte intégralContreras, Ivan, et Morton O’Kelly. « Hub Location Problems ». Dans Location Science, 327–63. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_12.
Texte intégralMarín, Alfredo, et Mercedes Pelegrín. « p-Median Problems ». Dans Location Science, 25–50. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_2.
Texte intégralAlumur, Sibel A., et Tolga Bektaş. « Green Location Problems ». Dans Location Science, 591–610. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_20.
Texte intégralÇalık, Hatice, Martine Labbé et Hande Yaman. « p-Center Problems ». Dans Location Science, 51–65. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_3.
Texte intégralActes de conférences sur le sujet "Locational problems"
Sharifi, Farid, Youmin Zhang et Brandon W. Gordon. « Voronoi-Based Coverage Control for Multi-Quadrotor UAVs ». Dans ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48651.
Texte intégralSrivastava, Amber, et Srinivasa M. Salapaka. « Robustness Analysis for Simultaneous Resource Allocation and Route Optimization Problems ». Dans ASME 2017 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/dscc2017-5179.
Texte intégralAlzorba, Shaghaf, et Christian Günther. « Algorithms for multicriteria location problems ». Dans 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.
Texte intégralManjunatha, Hemanth, Jida Huang, Binbin Zhang et Rahul Rai. « A Sequential Sampling Algorithm for Multi-Stage Static Coverage Problems ». Dans 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.
Texte intégralArghandeh, Reza, et Robert Broadwater. « Distributed Energy Storage Control for Optimal Adoption of Solar Energy in Residential Networks ». Dans 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.
Texte intégralLi, Zheng, Mo Yang et Yuwen Zhang. « Lattice Boltzmann Method Simulation of 3-D Melting Using Double MRT Model With Interfacial Tracking Method ». Dans 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.
Texte intégralAlizadeh, R., et T. Nishi. « Hybrid Covering Location Problem : Set Covering and Modular Maximal Covering Location Problem ». Dans 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2019. http://dx.doi.org/10.1109/ieem44572.2019.8978601.
Texte intégralGilbert, Jacob, MohammadTaghi Hajiaghayi, Hamed Saleh et Saeed Seddighin. « Location-Sensitive String Problems in MPC ». Dans 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.
Texte intégralPlaxton, C. Greg. « Approximation algorithms for hierarchical location problems ». Dans the thirty-fifth ACM symposium. New York, New York, USA : ACM Press, 2003. http://dx.doi.org/10.1145/780542.780549.
Texte intégralMakino, Kazuhisa. « Source Location Problems with Flow Requirements ». Dans 2012 Third International Conference on Networking and Computing (ICNC). IEEE, 2012. http://dx.doi.org/10.1109/icnc.2012.77.
Texte intégralRapports d'organisations sur le sujet "Locational problems"
Schulzrinne, H., L. Liess, H. Tschofenig, B. Stark et A. Kuett. Location Hiding : Problem Statement and Requirements. RFC Editor, janvier 2012. http://dx.doi.org/10.17487/rfc6444.
Texte intégralKoodli, R. IP Address Location Privacy and Mobile IPv6 : Problem Statement. RFC Editor, mai 2007. http://dx.doi.org/10.17487/rfc4882.
Texte intégralTschofenig, H., et H. Schulzrinne. GEOPRIV Layer 7 Location Configuration Protocol : Problem Statement and Requirements. RFC Editor, mars 2010. http://dx.doi.org/10.17487/rfc5687.
Texte intégralAhrens, David L., Daniel B. Olsen et 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), mars 2005. http://dx.doi.org/10.55274/r0011965.
Texte intégralPaul, Kylie, Jamie Faselt, Matthew Bell, Marcel P. Huijser, David Theobald, Annika Keeley et Robert Ament. West-Wide Study to Identify Important Highway Locations for Wildlife Crossings. Western Transportation Institute, 2023. http://dx.doi.org/10.15788/1706214520.
Texte intégralRodi, William L. Error Analysis in the Joint Event Location/Seismic Calibration Inverse Problem. Fort Belvoir, VA : Defense Technical Information Center, février 2008. http://dx.doi.org/10.21236/ada479709.
Texte intégralBrian Harder et Chacko John. MISSING WELL LOCATIONS : AN ENVIRONMENTAL RISK ASSESSMENT AND REGULATORY PROBLEM FOR LOUISIANA. Office of Scientific and Technical Information (OSTI), avril 2003. http://dx.doi.org/10.2172/820942.
Texte intégralFourie et Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), avril 2002. http://dx.doi.org/10.55274/r0010624.
Texte intégralSloan, Steven, Shelby Peterie, Richard Miller, Julian Ivanov, J. Schwenk et Jason McKenna. Detecting clandestine tunnels by using near-surface seismic techniques. Engineer Research and Development Center (U.S.), avril 2021. http://dx.doi.org/10.21079/11681/40419.
Texte intégralMeloy, John D. L51702 Precision Gas Pipeline Location-A Technology Study. Chantilly, Virginia : Pipeline Research Council International, Inc. (PRCI), janvier 1994. http://dx.doi.org/10.55274/r0010417.
Texte intégral