The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase semi-obnoxious (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2002-2023 (14)
Publication types (Num. hits)
article(13) inproceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
92Yoshiaki Ohsawa, Kazuki Tamura Efficient Location for a Semi-Obnoxious Facility. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF semi-obnoxious facility, efficient set, tradeoff curve, Voronoi diagram, location
66Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF obnoxious, semi-obnoxious, networks, facility location, multicriteria, MCDM
28Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind Line-Constrained k-Semi-Obnoxious Facility Location. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
28Andrea Wagner Locating a semi-obnoxious facility in the special case of Manhattan distances. Search on Bibsonomy Math. Methods Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
28Alejandro Teran-Somohano, Alice E. Smith Locating multiple capacitated semi-obnoxious facilities using evolutionary strategies. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
28Mehdi Golpayegani, Haleh Moradi, Reza Tavakkoli-Moghaddam Mathematical Modelling for a Semi-obnoxious Inverse Line Location Problem. Search on Bibsonomy IEEM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
28Mehdi Golpayegani, Jafar Fathali, Haleh Moradi A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
28Pilar Martínez Ortigosa, Eligius M. T. Hendrix, Juana López Redondo On heuristic bi-criterion methods for semi-obnoxious facility location. Search on Bibsonomy Comput. Optim. Appl. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
28Frank Plastria, José Gordillo, Emilio Carrizosa Locating a semi-obnoxious covering facility with repelling polygonal regions. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
28Ruhollah Heydari, Emanuel Melachrinoudis Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
28Oded Berman, Qian Wang Locating a semi-obnoxious facility with expropriation. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Oded Berman, Q. Wang Locating semi-obnoxious facilities with expropriation: minisum criterion. Search on Bibsonomy J. Oper. Res. Soc. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Emanuel Melachrinoudis, Zaharias Xanthopulos Semi-obnoxious single facility location in Euclidean space. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Anders J. V. Skriver, Kim Allan Andersen The bicriterion semi-obnoxious location (BSL) problem solved by an epsilon-approximation. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license