default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYahya Fathi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Saeed Saffari, Yahya Fathi
:
Bi-criteria set covering problem with conflict constraints. Comput. Ind. Eng. 186: 109759 (2023)- 2022
- [j20]Saeed Saffari, Yahya Fathi:
Set covering problem with conflict constraints. Comput. Oper. Res. 143: 105763 (2022) - 2020
- [j19]Golbarg K. Tutunchi, Yahya Fathi:
Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem. Comput. Ind. Eng. 146: 106400 (2020)
2010 – 2019
- 2019
- [j18]Golbarg K. Tutunchi, Yahya Fathi:
Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. Comput. Oper. Res. 101: 43-54 (2019) - [j17]Karthick Gopalswamy, Yahya Fathi, Reha Uzsoy:
Valid inequalities for concave piecewise linear regression. Oper. Res. Lett. 47(1): 52-58 (2019) - 2016
- [j16]Fatemeh Sayyady, Yahya Fathi:
An integer programming approach for solving the p-dispersion problem. Eur. J. Oper. Res. 253(1): 216-225 (2016) - 2015
- [j15]Fatemeh Sayyady, Golbarg K. Tutunchi, Yahya Fathi:
p-Median and p-dispersion problems: A bi-criteria analysis. Comput. Oper. Res. 61: 46-55 (2015) - [c7]Farid Alborzi, Rada Chirkova, Jon Doyle, Yahya Fathi:
Determining Query Readiness for Structured Data. DaWaK 2015: 3-14 - 2013
- [j14]Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi:
An integer programming approach for the view and index selection problem. Data Knowl. Eng. 83: 111-125 (2013) - 2012
- [j13]Zhe Liu, Yahya Fathi:
The nearest point problem in a polyhedral set and its extensions. Comput. Optim. Appl. 53(1): 115-130 (2012) - [c6]Rong Huang, Rada Chirkova, Yahya Fathi:
Two-Stage Stochastic View Selection for Data-Analysis Queries. ADBIS (2) 2012: 115-123 - [c5]Rong Huang, Rada Chirkova, Yahya Fathi:
Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms. ADBIS 2012: 195-208 - 2011
- [j12]Zhe Liu, Yahya Fathi:
An active index algorithm for the nearest point problem in a polyhedral cone. Comput. Optim. Appl. 49(3): 435-456 (2011) - 2010
- [j11]Kiavash Kianfar, Yahya Fathi:
Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions. Eur. J. Oper. Res. 207(1): 105-109 (2010)
2000 – 2009
- 2009
- [j10]Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi:
Exact and inexact methods for solving the problem of view selection for aggregate queries. Int. J. Bus. Intell. Data Min. 4(3/4): 391-415 (2009) - [j9]Kiavash Kianfar, Yahya Fathi:
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Math. Program. 120(2): 313-346 (2009) - [c4]Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring. ADBIS 2009: 133-148 - 2008
- [j8]Shona D. Morgan, Yahya Fathi:
Algorithms for the q-model clustering problem with application in switching cabinet manufacturing. Eur. J. Oper. Res. 189(3): 939-951 (2008) - [c3]Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
View and index selection for query-performance improvement: quality-centered algorithms and heuristics. CIKM 2008: 1329-1330 - [c2]Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
Exact and inexact methods for selecting views and indexes for OLAP performance improvement. EDBT 2008: 311-322 - 2007
- [j7]Girish Kulkarni, Yahya Fathi:
Integer programming models for the q. Eur. J. Oper. Res. 182(2): 612-625 (2007) - 2005
- [c1]Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi:
A Formal Model for the Problem of View Selection for Aggregate Queries. ADBIS 2005: 125-138 - 2004
- [j6]Yahya Fathi, Vural Aksakalli:
Heuristic methods for gang-rip saw arbor design. Eur. J. Oper. Res. 154(3): 626-640 (2004) - [j5]Bagas Wardono, Yahya Fathi:
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur. J. Oper. Res. 155(2): 380-401 (2004)
1990 – 1999
- 1991
- [j4]Yahya Fathi:
SQVAM: A variance minimizing algorithm. Oper. Res. Lett. 10(8): 461-466 (1991)
1980 – 1989
- 1986
- [j3]Yahya Fathi, Craig A. Tovey:
Affirmative action algorithms. Math. Program. 34(3): 292-301 (1986) - 1982
- [j2]Katta G. Murty, Yahya Fathi:
A critical index algorithm for nearest point problems on simplicial cones. Math. Program. 23(1): 206-215 (1982)
1970 – 1979
- 1979
- [j1]Yahya Fathi:
Computational complexity of LCPs associated with positive definite symmetric matrices. Math. Program. 17(1): 335-344 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
