Littérature scientifique sur le sujet « Variants of the p-Center problem »
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 « Variants of the p-Center problem ».
À 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 "Variants of the p-Center problem"
Dupin, Nicolas, Frank Nielsen et El-Ghazali Talbi. « Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front ». Mathematics 9, no 4 (23 février 2021) : 453. http://dx.doi.org/10.3390/math9040453.
Texte intégralEskandari, Marzieh, Bhavika B. Khare, Nirman Kumar et Bahram Sadeghi Bigham. « Red–Blue k-Center Clustering with Distance Constraints ». Mathematics 11, no 3 (2 février 2023) : 748. http://dx.doi.org/10.3390/math11030748.
Texte intégralBAREQUET, GILL, et SARIEL HAR-PELED. « POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD ». International Journal of Computational Geometry & ; Applications 11, no 04 (août 2001) : 465–74. http://dx.doi.org/10.1142/s0218195901000596.
Texte intégralAndrei, Ionica. « Existence Theorems for Some Classes of Boundary Value Problems Involving the P(X)-Laplacian ». Nonlinear Analysis : Modelling and Control 13, no 2 (25 avril 2008) : 145–58. http://dx.doi.org/10.15388/na.2008.13.2.14575.
Texte intégralWen, Fayuan, Angela Rock, Juan Salomon-Andonie, Gulriz Kurban, Xiaomei Niu, Songping Wang, Xu Zhang et al. « Genome Wide Association Analysis of Iron Overload in the Trans-Omics for Precision Medicine (TOPMed) Sickle Cell Disease Cohorts ». Blood 136, Supplement 1 (5 novembre 2020) : 52. http://dx.doi.org/10.1182/blood-2020-142809.
Texte intégralArya, Akschat, Boominathan Perumal et Santhi Krishnan. « Parallelized solution to the asymmetric travelling salesman problem using central processing unit acceleration ». Indonesian Journal of Electrical Engineering and Computer Science 25, no 3 (1 mars 2022) : 1795. http://dx.doi.org/10.11591/ijeecs.v25.i3.pp1795-1802.
Texte intégralSEITBEKOVA, А., et А. AMIRBEKOVA. « PHONETIC VARIANTS OF LOANWORDS ». Iasaýı ýnıversıtetіnіń habarshysy 125, no 3 (15 septembre 2022) : 37–47. http://dx.doi.org/10.47526/2022-3/2664-0686.03.
Texte intégralPăun, Gheorghe. « One More Universality Result for P Systems with Objects on Membranes ». International Journal of Computers Communications & ; Control 1, no 1 (1 janvier 2006) : 25. http://dx.doi.org/10.15837/ijccc.2006.1.2269.
Texte intégralAksenova, Irina Vasil’evna, Yuliya Igorevna Naumova et Vladimir Valentinovich Gridyushko. « Perspectives of the contemporary usage of circular locomotive depot buildings ». Vestnik MGSU, no 2 (février 2016) : 9–19. http://dx.doi.org/10.22227/1997-0935.2016.2.9-19.
Texte intégralAdamuthe, Amol C., et Smita M. Kagwade. « Hybrid and adaptive harmony search algorithm for optimizing energy efficiency in VMP problem in cloud environment ». Decision Science Letters 11, no 2 (2022) : 113–26. http://dx.doi.org/10.5267/j.dsl.2022.1.001.
Texte intégralThèses sur le sujet "Variants of the p-Center problem"
Sim, Thaddeus Kim Teck. « The hub covering flow problem and the stochastic p-hub center problem ». Diss., University of Iowa, 2007. http://ir.uiowa.edu/etd/124.
Texte intégralHaddad, Marcel Adonis. « Nouveaux modèles robustes et probabilistes pour la localisation d'abris dans un contexte de feux de forêt ». Electronic Thesis or Diss., Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLD021.
Texte intégralThe location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in acontext of an increasing number of catastrophic and severe forest fires. The problem is basically to locate p sheltersminimizing the maximum distance people will have to cover to reach the closest accessible shelter in case of fire. Thelandscape is divided in zones and is modeled as an edge-weighted graph with vertices corresponding to zones andedges corresponding to direct connections between two adjacent zones. Each scenario corresponds to a fire outbreak ona single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways. First, an evacuationpath cannot pass through the vertex on fire. Second, the fact that someone close to the fire may have limited choice, ormay not take rational decisions, when selecting a direction to escape is modeled using a new kind of evacuation strategy.This evacuation strategy, called Under Pressure, induces particular evacuation distances which render our model specific.We propose two problems with this model: the Robust p-Center Under Pressure problem and the Probabilistic p-CenterUnder Pressure problem. First we prove hardness results for both problems on relevant classes of graphs for our context.In addition, we propose polynomial exact algorithms on simple classes of graphs and we develop mathematical algorithmsbased on integer linear programming
Eraslan, Demirci Sukran. « A Genetic Algorithm For The P-hub Center Problem With Stochastic Service Level Constraints ». Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612940/index.pdf.
Texte intégralkran M.Sc., Department of Industrial Engineering Supervisor: Asst. Prof. Dr. Sedef Meral December 2010, 170 pages The emphasis on minimizing the costs and travel times in a network of origins and destinations has led the researchers to widely study the hub location problems in the area of location theory in which locating the hub facilities and designing the hub networks are the issues. The p-hub center problem considering these issues is the subject of this study. p-hub center problem with stochastic service level constraints and a limitation on the travel times between the nodes and hubs is addressed, which is an uncapacitated, single allocation problem with a complete hub network. Both a mathematical model and a genetic algorithm are proposed for the problem. We discuss the general framework of the genetic algorithm as well as the problem-specific components of algorithm. The computational studies of the proposed algorithm are realized on a number of problem instances from Civil Aeronautics Board (CAB) data set and Turkish network data set. The computational results indicate that the proposed genetic algorithm gives satisfactory results when compared with the optimum solutions and solutions obtained with other heuristic methods.
Calik, Hatice. « Exact solution methodologies for the p-center problem under single and multiple allocation strategies ». Doctoral thesis, Bilkent University, Ankara, Turkey, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/238641.
Texte intégralWei, Hu. « SOLVING CONTINUOUS SPACE LOCATION PROBLEMS ». The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.
Texte intégralSilav, Ahmet. « Bi-objective Facility Location Problems In The Presence Of Partial Coverage ». Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12610681/index.pdf.
Texte intégralYang, Chih-Shiang, et 楊智翔. « New Algorithmic Results on the Connected p-Center Problem and Its Variants ». Thesis, 2010. http://ndltd.ncl.edu.tw/handle/91313818201500460028.
Texte intégral世新大學
資訊管理學研究所(含碩專班)
98
The essential p-Center problem is to determine a set of p vertices of a graph G for building facilities. The objective is to minimize the maximum access distance of clients at all vertices. Let G(V, E, l, w) be a n-vertex and m-edge graph with lengths on edges and weights on vertices. Given a graph G(V, E, l, w), a practical variant, called the Weighted Connected p-Center problem (the WCpC problem), is to find a p-center of G such that the maximum weighted access distance of clients at all vertices is minimized under the additional restriction in which requires the selected p-center induce a connected subgraph of G. If w(v) = 1, for all v in V, then the problem is abbreviated as the CpC problem. We first prove that the CpC problem is NP-Hard on planar graphs and interval graphs, respectively. Second, we propose two algorithms for the WCpC problem on trees with time-complexities O(pn) and O(n log2n), respectively, by different approaches. Meanwhile, if w(v) ? C, for all v in V, where C is a set of k numbers, for some small integer k, then another algorithm with time-complexity O(kn) is proposed. Next, the extension to graphs with forbidden vertices, called the Forbidden Weighted Connected p-Center problem (the FWCpC problem) is discussed. We show that the FWCpC problem can be also solved in O(n log2n) time. Finally, we propose an O(n) time algorithm for the FCpC problem on interval graphs with unit vertex-weights and unit edge-lengths.
Chen, Chien Tsai, et 陳建材. « The p-center problem with some practical constrints ». Thesis, 2006. http://ndltd.ncl.edu.tw/handle/80686676030458876484.
Texte intégral世新大學
資訊管理學研究所(含碩專班)
94
This thesis addresses the p-Center problem with some practical constraints. Let G(V, E, W) denote a graph with n-vertex-set V and m-edge-set E in which W is a function mapping each edge e to a positive distance W(e). The traditional p-Center problem is to locate some kind of facilities at p vertices of G to minimize the maximum distance between any vertex and the nearest facility corresponding to that vertex. This thesis considers some more practical constraints. We first require that the p vertices in which the facilities are located must be connected, i.e., the subgraph induced by the p facility vertices must be connected. The resulting problem is called the Connected p-Center problem (the CpC problem). Meanwhile, we deal with further restriction in which all vertices in F cannot be included in any feasible solution, for any given subset F of V. The vertices in F are called forbidden vertices and the problem is called the Forbidden Connected p-Center problem (the FCpC problem). We first show that the CpC problem is NP-Hard on bipartite graphs. Second, O(n)-time and O(pn)-time algorithms for the CpC problem on trees and 3-cactus graphs are proposed, respectively. Finally, the algorithmic results are extended to the FCpC problem on trees and 3-cactus graphs. The time-complexities remain O(n) and O(pn), respectively.
Chen, Sen-Miao, et 陳森淼. « A Study on Total p-Center Problem on Graphs ». Thesis, 2011. http://ndltd.ncl.edu.tw/handle/95469863086488951842.
Texte intégral世新大學
資訊管理學研究所(含碩專班)
99
This thesis introduces a new useful and interesting variation of the traditional p-Center problem on graphs, called the Total p-Center problem (the TpC problem). Its goal is to find a p-vertex set Q of a graph G(V, E, w, l) with weights on vertices and lengths on edges such that the maximum weighted access distance of all vertices not in Q to their nearest vertices in Q is minimized, and the induced subgraph by Q cannot include any isolated vertex. In this research, we concentrate on the situation that the induced subgraph by the center vertices is formed by exactly k components, called the k-Com TpC problem. We first show that the k-Com TpC problem on planar graphs and bipartite graphs with {1, 2}-edge-length is NP-hard, respectively. Meanwhile, O(pnlogn) time algorithms are proposed for the 2-Com p-Center problem and the 2-Com TpC problem on paths, respectively. After then, on graphs with forbidden vertices, we show that both 2-Com p-Center problem and the 2-Com TpC problem on paths are also O(pnlogn) time solvable.
Wu, Tzung-Shiun, et 吳宗勳. « The p-center location problem on undirected connected graphs ». Thesis, 2015. http://ndltd.ncl.edu.tw/handle/08117752500540605601.
Texte intégral國立臺北商業大學
資訊與決策科學研究所
103
Public facilities is a quite practical and important issue. Facility plans need to fit all kinds of demands at various times and places. Generally speaking, fundamental facilities are mostly permanent building structures, which provide long-term services to people; and of course, it cannot be renovated or relocated frequently. Moreover, it is presumed that, the better the location the infrastructures are located at, the less costs and transportation it required, and the bigger cost-efficient. The p-center problem have applications in the location allocation problem, the p-center problem is to give a undirected connected graph G = (V,E) and p,then find a subset S∈E of at most p which minimizes the maximum distances from points in V to S. We employ recursive algorithm and branch-and-bound algorithm for solving the p-center problem and attempt to find out the more efficient algorithm among these two. From the experimental results, the recursive algorithm has affected by the number of edges, which growing quite fast. On the other hand, branch-and-bound algorithm is opposite; and the effect of the number of edge is not obvious. But instead, increasing the number of points and p values has largely affected. When the point of the graph of the inner edge is less than 1.3 times, it will be more efficient solving the p-center problem by using the recursive algorithm method than the branch-and-bound algorithm.
Livres sur le sujet "Variants of the p-Center problem"
El trabajo inmaterial como problema de la filosofía política. Teseo, 2017. http://dx.doi.org/10.55778/ts870515906.
Texte intégralPsicoanálisis y educación : un diálogo de encuentros y desencuentros. Teseo, 2016. http://dx.doi.org/10.55778/ts877230888.
Texte intégralBusdygan, Daniel. Rostros del igualitarismo. Teseo, 2020. http://dx.doi.org/10.55778/ts878633695.
Texte intégralGleń-Karolczyk, Katarzyna. Zabiegi ochronne kształtujące plonowanie zdrowotność oraz różnorodność mikroorganizmów związanych z czernieniem pierścieniowym korzeni chrzanu (Atmoracia rusticana Gaertn.). Publishing House of the University of Agriculture in Krakow, 2019. http://dx.doi.org/10.15576/978-83-66602-39-7.
Texte intégralCuevas Arenas, Héctor, Caroline Cunill, Daniela Vásquez Pino, Fredy A. Montoya López et Paula Daza Tobasura. Conflictos indígenas ante la justicia colonial : los hilos entrelazados de una compleja trama social y legal, siglos XVI-XVIII. Editorial Universidad Santiago de Cali, 2020. http://dx.doi.org/10.35985/9789585147614.
Texte intégralChapitres de livres sur le sujet "Variants of the p-Center problem"
Ales, Zacharie, et Sourour Elloumi. « Compact MILP Formulations for the p-Center Problem ». Dans Lecture Notes in Computer Science, 14–25. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96151-4_2.
Texte intégralBai, Chunsong, Liying Kang et Erfang Shan. « The Connected p-Center Problem on Cactus Graphs ». Dans Combinatorial Optimization and Applications, 718–25. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48749-6_53.
Texte intégralYang, Kai, Yankui Liu et Xin Zhang. « Stochastic p-Hub Center Problem with Discrete Time Distributions ». Dans Advances in Neural Networks – ISNN 2011, 182–91. Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21090-7_22.
Texte intégralQuevedo-Orozco, Dagoberto R., et Roger Z. Ríos-Mercado. « A New Heuristic for the Capacitated Vertex p-Center Problem ». Dans Advances in Artificial Intelligence, 279–88. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40643-0_29.
Texte intégralDe Walsche, Niels, Carlo S. Sartori et Hatice Çalık. « A Radius-Based Approach for the Bi-Objective p-Center and p-Dispersion Problem ». Dans Lecture Notes in Computer Science, 533–49. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43612-3_33.
Texte intégralChen, Li-Hsuan, Sun-Yuan Hsieh, Ling-Ju Hung et Ralf Klasing. « The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality ». Dans Lecture Notes in Computer Science, 112–23. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_10.
Texte intégralChen, Li-Hsuan, Sun-Yuan Hsieh, Ling-Ju Hung et Ralf Klasing. « Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs ». Dans Lecture Notes in Computer Science, 115–27. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94667-2_10.
Texte intégralChen, Li-Hsuan, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee et Bang Ye Wu. « On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ». Dans Lecture Notes in Computer Science, 152–63. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57586-5_14.
Texte intégralDing, Wei, et Ke Qiu. « Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs ». Dans Algorithmic Aspects in Information and Management, 62–71. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-27195-4_6.
Texte intégralLonde, Mariana A., Luciana S. Pessoa et Carlos E. Andrade. « The P-Next Center Problem with Capacity and Coverage Radius Constraints : Model and Heuristics ». Dans Metaheuristics, 335–49. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-26504-4_24.
Texte intégralActes de conférences sur le sujet "Variants of the p-Center problem"
de Weerdt, Mathijs, Michael Albert, Vincent Conitzer et Koos van der Linden. « Complexity of Scheduling Charging in the Smart Grid ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/658.
Texte intégralShrinidhi, M., T. K. Kaushik Jegannathan et R. Jeya. « Classification of Imbalanced Datasets Using Various Techniques along with Variants of SMOTE Oversampling and ANN ». Dans International Research Conference on IOT, Cloud and Data Science. Switzerland : Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-338i7w.
Texte intégralHariharan, Smitha, et Venkat Allada. « Uncertain Demand Driven Resource Platform Design for a Service Center ». Dans ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81191.
Texte intégralChan, Hau, Aris Filos-Ratsikas, Bo Li, Minming Li et Chenhao Wang. « Mechanism Design for Facility Location Problems : A Survey ». Dans Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California : International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/596.
Texte intégralMousa, Amr, et Gerhard Benedikt Weiss. « Advanced Energy Management Strategies for Plug-In Hybrid Electric Vehicles via Deep Reinforcement Learning ». Dans SAE 2022 Intelligent and Connected Vehicles Symposium. 400 Commonwealth Drive, Warrendale, PA, United States : SAE International, 2022. http://dx.doi.org/10.4271/2022-01-7109.
Texte intégralYen, William Chung-Kung, et Chien-Tsai Chen. « The Connected p-Center Problem with Extension ». Dans 9th Joint Conference on Information Sciences. Paris, France : Atlantis Press, 2006. http://dx.doi.org/10.2991/jcis.2006.216.
Texte intégralZhang, Qingyun, Zhipeng Lü, Zhouxing Su, Chumin Li, Yuan Fang et Fuda Ma. « Vertex Weighting-Based Tabu Search for p-Center Problem ». Dans Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California : International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/206.
Texte intégralFerone, Daniele, Paola Festa, Antonio Napoletano et Mauricio G. C. Resende. « On the fast solution of the p-center problem ». Dans 2017 19th International Conference on Transparent Optical Networks (ICTON). IEEE, 2017. http://dx.doi.org/10.1109/icton.2017.8024978.
Texte intégralShariff, S. Sarifah Radiah, Mohd Omar et Noor Hasnah Moin. « Location Routing Inventory Problem with Transshipment Points Using p-Center ». Dans 2016 International Conference on Industrial Engineering, Management Science and Application (ICIMSA). IEEE, 2016. http://dx.doi.org/10.1109/icimsa.2016.7504016.
Texte intégralBashiri, M., et S. Mehrabi. « Stochastic p-hub center covering problem with delivery time constraint ». Dans EM). IEEE, 2010. http://dx.doi.org/10.1109/ieem.2010.5674340.
Texte intégralRapports d'organisations sur le sujet "Variants of the p-Center problem"
Moreno, Viviana Carolina, Ximena Castro, Claudia Marcela Muñoz et Giomar Sichaca Ávila. Situación de salud pública y migración en tiempos de pandemia, Necoclí, Antioquia, 2021. Instituto Nacional de Salud, janvier 2022. http://dx.doi.org/10.33610/01229907.2022v4n1a1.
Texte intégralVail, Kylin, Bret Lizundia, David Welch et Evan Reis. Earthquake Damage Workshop (PEER-CEA Project). Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, novembre 2020. http://dx.doi.org/10.55461/plbd5536.
Texte intégralSchiller, Brandon, Tara Hutchinson et Kelly Cobeen. Cripple Wall Small-Component Test Program : Wet Specimens I (PEER-CEA Project). Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, novembre 2020. http://dx.doi.org/10.55461/dqhf2112.
Texte intégralSchiller, Brandon, Tara Hutchinson et Kelly Cobeen. Cripple Wall Small-Component Test Program : Wet Specimens II (PEER-CEA Project). Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, novembre 2020. http://dx.doi.org/10.55461/ldbn4070.
Texte intégralSchiller, Brandon, Tara Hutchinson et Kelly Cobeen. Comparison of the Response of Small- and Large-Component Cripple Wall Specimens Tested under Simulated Seismic Loading (PEER-CEA Project). Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, novembre 2020. http://dx.doi.org/10.55461/iyca1674.
Texte intégralVargas-Herrera, Hernando, Juan José Ospina, Carlos Alfonso Huertas-Campos, Adolfo León Cobo-Serna, Edgar Caicedo-García, Juan Pablo Cote-Barón, Nicolás Martínez-Cortés et al. Informe de Política Monetaria - Julio de 2021. Banco de la República de Colombia, août 2021. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr3.-2021.
Texte intégral