Search results for "obnoxious"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
117	Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye	A branch-and-cut method for the obnoxious p -median problem.	4OR	2007	DBLP DOI BibTeX RDF	Obnoxious facility location, Branch-and-cut, p-Median
100	Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver	Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	obnoxious, semi-obnoxious, networks, facility location, multicriteria, MCDM
95	Carlos Ferreira 0001, Beatriz Sousa Santos	Information Visualization in Locating Obnoxious Facility: Some Examples with Mono and Bicriteria Models.	IV	2000	DBLP DOI BibTeX RDF	obnoxious facilities, routing, Information Visualization, location
72	Yoshiaki Ohsawa, Kazuki Tamura	Efficient Location for a Semi-Obnoxious Facility.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	semi-obnoxious facility, efficient set, tradeoff curve, Voronoi diagram, location
67	Danny Z. Chen, Haitao Wang 0001	Locating an Obnoxious Line among Planar Objects.	ISAAC	2009	DBLP DOI BibTeX RDF
45	Sergio Cabello, Günter Rote	Obnoxious centers in graphs.	SODA	2007	DBLP BibTeX RDF
45	Yu Xia	The Ellipsoidal lp Norm Obnoxious Facility Location Problem.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
45	Zhongping Qin, Yin-Feng Xu, Binhai Zhu	On Some Optimization Problems in Obnoxious Facility Location.	COCOON	2000	DBLP DOI BibTeX RDF
44	Prosenjit Bose, Qingda Wang	Facility Location Constrained to a Polygonal Domain.	LATIN	2002	DBLP DOI BibTeX RDF
27	Elisabeth Gassner	The inverse 1-maxian problem with edge length modification.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Obnoxious location, Maxian, Complexity, Tree, Inverse problem
23	Marco Locatelli 0001	A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools.	Optim. Lett.	2024	DBLP DOI BibTeX RDF
23	Malgorzata Miklas-Kalczynska, Pawel Jan Kalczynski	Multiple obnoxious facility location: the case of protected areas.	Comput. Manag. Sci.	2024	DBLP DOI BibTeX RDF
23	Jiaqian Li, Minming Li, Hau Chan	Strategyproof Mechanisms for Group-Fair Obnoxious Facility Location Problems.	AAAI	2024	DBLP DOI BibTeX RDF
23	Alexander Lam, Haris Aziz 0001, Bo Li 0037, Fahimeh Ramezani 0002, Toby Walsh	Proportional Fairness in Obnoxious Facility Location.	AAMAS	2024	DBLP BibTeX RDF
23	Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha	The obnoxious facility location game with dichotomous preferences.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
23	Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind	Line-Constrained k-Semi-Obnoxious Facility Location.	CoRR	2023	DBLP DOI BibTeX RDF
23	Haris Aziz 0001, Alexander Lam, Bo Li 0037, Fahimeh Ramezani 0002, Toby Walsh	Proportional Fairness in Obnoxious Facility Location.	CoRR	2023	DBLP DOI BibTeX RDF
23	Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi	The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.	Knowl. Based Syst.	2023	DBLP DOI BibTeX RDF
23	Sepideh Mohammadi, Behrooz Alizadeh, Esmaeil Afrashteh	Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks.	Comput. Appl. Math.	2023	DBLP DOI BibTeX RDF
23	Rongrong Chen, Qianlong Xiao, Minghao Hu, Jiaxu Xing, Fei Tang, Jing Qiu 0002	Efficient Algorithms for Obnoxious Facility Location on a Line Segment or Circle.	CloudNet	2023	DBLP DOI BibTeX RDF
23	Haris Aziz 0001, Alexander Lam, Bo Li 0037, Fahimeh Ramezani 0002, Toby Walsh	Proportional Fairness in Obnoxious Facility Location.	AAMAS	2023	DBLP BibTeX RDF
23	Richard L. Church, Zvi Drezner	Review of obnoxious facilities location problems.	Comput. Oper. Res.	2022	DBLP DOI BibTeX RDF
23	Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner	Multiple obnoxious facilities with weighted demand points.	J. Oper. Res. Soc.	2022	DBLP DOI BibTeX RDF
23	Pawel Jan Kalczynski, Zvi Drezner	Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
23	Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar	A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
23	Gabriel Istrate, Cosmin Bonchis	Mechanism Design With Predictions for Obnoxious Facility Location.	CoRR	2022	DBLP DOI BibTeX RDF
23	Bowei Zhang	Efficient Algorithms for Obnoxious Facility Location on a Line Segment or Circle.	CoRR	2022	DBLP DOI BibTeX RDF
23	Tim A. Hartmann, Stefan Lendl	Dispersing Obnoxious Facilities on Graphs by Rounding Distances.	CoRR	2022	DBLP DOI BibTeX RDF
23	Edukondalu Chappidi, Alok Singh 0001	An evolutionary approach for obnoxious cooperative maximum covering location problem.	Appl. Intell.	2022	DBLP DOI BibTeX RDF
23	Tim A. Hartmann, Stefan Lendl	Dispersing Obnoxious Facilities on Graphs by Rounding Distances.	MFCS	2022	DBLP DOI BibTeX RDF
23	Martin C. Libicki	Obnoxious Deterrence.	CyCom	2022	DBLP DOI BibTeX RDF
23	Ling Gai, Mengpei Liang, Chenhao Wang 0001	Obnoxious Facility Location Games with Candidate Locations.	AAIM	2022	DBLP DOI BibTeX RDF
23	Jian Chang, Lifang Wang, Jin-Kao Hao, Yang Wang 0098	Parallel iterative solution-based tabu search for the obnoxious p-median problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
23	Pawel Jan Kalczynski, Zvi Drezner	The obnoxious facilities planar p-median problem.	OR Spectr.	2021	DBLP DOI BibTeX RDF
23	Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger	Dispersing Obnoxious Facilities on a Graph.	Algorithmica	2021	DBLP DOI BibTeX RDF
23	Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha	The Obnoxious Facility Location Game with Dichotomous Preferences.	CoRR	2021	DBLP BibTeX RDF
23	Chang-Chun Lin, Yen-I Chiang	Alternative formulations for the obnoxious p-median problem.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
23	Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha	The Obnoxious Facility Location Game with Dichotomous Preferences.	ICTCS	2021	DBLP BibTeX RDF
23	Vishwanath R. Singireddy, Manjanna Basappa	Constrained Obnoxious Facility Location on a Line Segment.	CCCG	2021	DBLP BibTeX RDF
23	Muhammad Hanif 0004, Li Zhang, Nasir Mujtaba, Jiacheng Li, Abdul Hakim Shah, Saif Ullah	A Single Non-obnoxious Facility Location Selection for Utility Stores Corporation Using Center of Gravity and P-median Methods.	IEEM	2021	DBLP DOI BibTeX RDF
23	Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab	Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks.	Ann. Oper. Res.	2020	DBLP DOI BibTeX RDF
23	Alberto Herran, José Manuel Colmenar, Rafael Martí, Abraham Duarte	A parallel variable neighborhood search approach for the obnoxious p-median problem.	Int. Trans. Oper. Res.	2020	DBLP DOI BibTeX RDF
23	Nenad Mladenovic, Abdulaziz Alkandari, Jun Pei, Raca Todosijevic, Panos M. Pardalos	Less is more approach: basic variable neighborhood search for the obnoxious p-median problem.	Int. Trans. Oper. Res.	2020	DBLP DOI BibTeX RDF
23	Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski	Multiple obnoxious facilities location: A cooperative model.	IISE Trans.	2020	DBLP DOI BibTeX RDF
23	Pawel Jan Kalczynski, Atsuo Suzuki, Zvi Drezner	Obnoxious facility location: the case of weighted demand points.	CoRR	2020	DBLP BibTeX RDF
23	Osman Gökalp	An iterated greedy algorithm for the obnoxious p-median problem.	Eng. Appl. Artif. Intell.	2020	DBLP DOI BibTeX RDF
23	Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi	λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2019	DBLP DOI BibTeX RDF
23	Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab	Inverse obnoxious p-median location problems on trees with edge length modifications under different norms.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
23	Andrea Wagner	Locating a semi-obnoxious facility in the special case of Manhattan distances.	Math. Methods Oper. Res.	2019	DBLP DOI BibTeX RDF
23	Alejandro Teran-Somohano, Alice E. Smith	Locating multiple capacitated semi-obnoxious facilities using evolutionary strategies.	Comput. Ind. Eng.	2019	DBLP DOI BibTeX RDF
23	Yukun Cheng, Qiaoming Han, Wei Yu 0010, Guochuan Zhang	Strategy-proof mechanisms for obnoxious facility game with bounded service range.	J. Comb. Optim.	2019	DBLP DOI BibTeX RDF
23	Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger	Dispersing Obnoxious Facilities on a Graph.	STACS	2019	DBLP DOI BibTeX RDF
23	Geng Lin, Jian Guan 0007	A hybrid binary particle swarm optimization for the obnoxious p-median problem.	Inf. Sci.	2018	DBLP DOI BibTeX RDF
23	Tammy Drezner, Zvi Drezner, Anita Schöbel	The Weber obnoxious facility location model: A Big Arc Small Arc approach.	Comput. Oper. Res.	2018	DBLP DOI BibTeX RDF
23	Behrooz Alizadeh, Roghayeh Etemad	Optimal algorithms for inverse vertex obnoxious center location problems on graphs.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
23	Lili Mei, Deshi Ye, Guochuan Zhang	Mechanism design for one-facility location game with obnoxious effects on a line.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
23	Roghayeh Etemad, Behrooz Alizadeh	Reverse selective obnoxious center location problems on tree graphs.	Math. Methods Oper. Res.	2018	DBLP DOI BibTeX RDF
23	Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger	Dispersing obnoxious facilities on a graph.	CoRR	2018	DBLP BibTeX RDF
23	José Manuel Colmenar, Rafael Martí, Abraham Duarte	Multi-objective memetic optimization for the bi-objective obnoxious p-median problem.	Knowl. Based Syst.	2018	DBLP DOI BibTeX RDF
23	Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab	Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks.	J. Optim. Theory Appl.	2018	DBLP DOI BibTeX RDF
23	Lili Mei, Deshi Ye, Yong Zhang 0001	Approximation strategy-proof mechanisms for obnoxious facility location on a line.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
23	Jesús Sánchez-Oro, J. Manuel Colmenar, Enrique García-Galán, Ana Dolores López-Sánchez	How to Locate Disperse Obnoxious Facility Centers?	ICVNS	2018	DBLP DOI BibTeX RDF
23	Mehdi Golpayegani, Haleh Moradi, Reza Tavakkoli-Moghaddam	Mathematical Modelling for a Semi-obnoxious Inverse Line Location Problem.	IEEM	2018	DBLP DOI BibTeX RDF
23	Nasrin Asgari, Mohsen Rajabi, Masoumeh Jamshidi, Maryam Khatami, Reza Zanjirani Farahani	A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study.	Ann. Oper. Res.	2017	DBLP DOI BibTeX RDF
23	Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi	Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.	J. Graph Algorithms Appl.	2017	DBLP DOI BibTeX RDF
23	Mehdi Golpayegani, Jafar Fathali, Haleh Moradi	A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm.	Comput. Ind. Eng.	2017	DBLP DOI BibTeX RDF
23	Morito Oomine, Hiroshi Nagamochi	Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees.	IEICE Trans. Inf. Syst.	2016	DBLP DOI BibTeX RDF
23	J. Manuel Colmenar, Peter Greistorfer, Rafael Martí, Abraham Duarte	Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem.	Eur. J. Oper. Res.	2016	DBLP DOI BibTeX RDF
23	Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi	Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game.	WALCOM	2016	DBLP DOI BibTeX RDF
23	Lili Mei, Deshi Ye, Guochuan Zhang	Mechanism Design for One-Facility Location Game with Obnoxious Effects.	FAW	2016	DBLP DOI BibTeX RDF
23	Pilar Martínez Ortigosa, Eligius M. T. Hendrix, Juana López Redondo	On heuristic bi-criterion methods for semi-obnoxious facility location.	Comput. Optim. Appl.	2015	DBLP DOI BibTeX RDF
23	Itai Feigenbaum, Jay Sethuraman	Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models.	AAAI Workshop: Incentive and Trust in E-Communities	2015	DBLP BibTeX RDF
23	Deshi Ye, Lili Mei, Yong Zhang 0001	Strategy-Proof Mechanism for Obnoxious Facility Location on a Line.	COCOON	2015	DBLP DOI BibTeX RDF
23	Itai Feigenbaum, Jay Sethuraman	Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location.	CoRR	2014	DBLP BibTeX RDF
23	Behrooz Alizadeh, Rainer E. Burkard	A linear time algorithm for inverse obnoxious center location problems on networks.	Central Eur. J. Oper. Res.	2013	DBLP DOI BibTeX RDF
23	Yukun Cheng, Wei Yu 0010, Guochuan Zhang	Strategy-proof approximation mechanisms for an obnoxious facility game on networks.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
23	Frank Plastria, José Gordillo, Emilio Carrizosa	Locating a semi-obnoxious covering facility with repelling polygonal regions.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
23	Yukun Cheng, Qiaoming Han, Wei Yu 0010, Guochuan Zhang	Obnoxious Facility Game with a Bounded Service Range.	TAMC	2013	DBLP DOI BibTeX RDF
23	Fang Tian, Zi-Long Liu	Probabilistic single obnoxious facility location with fixed budget.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
23	Ruhollah Heydari, Emanuel Melachrinoudis	Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives.	Eur. J. Oper. Res.	2012	DBLP DOI BibTeX RDF
23	Danny Z. Chen, Haitao Wang 0001	Locating an obnoxious Line among Planar Objects.	Int. J. Comput. Geom. Appl.	2012	DBLP DOI BibTeX RDF
23	Ken Ibara, Hiroshi Nagamochi	Characterizing Mechanisms in Obnoxious Facility Game.	COCOA	2012	DBLP DOI BibTeX RDF
23	Yukun Cheng, Wei Yu 0010, Guochuan Zhang	Mechanisms for Obnoxious Facility Game on a Path.	COCOA	2011	DBLP DOI BibTeX RDF
23	Shimon Abravaya, Michael Segal 0001	Maximizing the number of obnoxious facilities to locate within a bounded region.	Comput. Oper. Res.	2010	DBLP DOI BibTeX RDF
23	Sergio Cabello, Günter Rote	Obnoxious Centers in Graphs.	SIAM J. Discret. Math.	2010	DBLP DOI BibTeX RDF
23	Oded Berman, Qian Wang	Locating a semi-obnoxious facility with expropriation.	Comput. Oper. Res.	2008	DBLP DOI BibTeX RDF
23	Oded Berman, Q. Wang	Locating semi-obnoxious facilities with expropriation: minisum criterion.	J. Oper. Res. Soc.	2007	DBLP DOI BibTeX RDF
23	José Miguel Díaz-Báñez, Ferran Hurtado	Computing obnoxious 1-corner polygonal chains.	Comput. Oper. Res.	2006	DBLP DOI BibTeX RDF
23	Arie Tamir	Locating two obnoxious facilities using the weighted maximin criterion.	Oper. Res. Lett.	2006	DBLP DOI BibTeX RDF
23	José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès	Locating an obnoxious plane.	Eur. J. Oper. Res.	2006	DBLP DOI BibTeX RDF
23	Blaz Zmazek, Janez Zerovnik	The obnoxious center problem on weighted cactus graphs.	Discret. Appl. Math.	2004	DBLP DOI BibTeX RDF
23	Emanuel Melachrinoudis, Zaharias Xanthopulos	Semi-obnoxious single facility location in Euclidean space.	Comput. Oper. Res.	2003	DBLP DOI BibTeX RDF
23	Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura	Computing an obnoxious anchored segment.	Oper. Res. Lett.	2003	DBLP DOI BibTeX RDF
23	Anders J. V. Skriver, Kim Allan Andersen	The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation.	Eur. J. Oper. Res.	2003	DBLP DOI BibTeX RDF
23	Paola Cappanera, Giorgio Gallo, Francesco Maffioli	Discrete facility location and routing of obnoxious activities.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
23	Michael Segal 0001	Placing an Obnoxious Facility in Geometric Networks.	Nord. J. Comput.	2003	DBLP BibTeX RDF
23	Peter Thomas, Yupo Chan, Lee J. Lehmkuhl, William Nixon	Obnoxious-facility location and data-envelopment analysis: A combined distance-based formulation.	Eur. J. Oper. Res.	2002	DBLP DOI BibTeX RDF
23	Blaz Zmazek, Janez Zerovnik	The obnoxious center problem on weighted cactus graphs (Extended Abstract).	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
23	Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote	The Obnoxious Center Problem on a Tree.	SIAM J. Discret. Math.	2001	DBLP DOI BibTeX RDF
23	Oded Berman, Zvi Drezner	A note on the location of an obnoxious facility on a network.	Eur. J. Oper. Res.	2000	DBLP DOI BibTeX RDF