Yahya Fathi

Orcid: 0000-0003-4592-6459

According to our database1, Yahya Fathi authored at least 28 papers between 1979 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Bi-criteria set covering problem with conflict constraints.
Comput. Ind. Eng., December, 2023

2022
Set covering problem with conflict constraints.
Comput. Oper. Res., 2022

2020
Representative subsets of non-dominated points in the bi-criteria <i>p</i>-median <i>p</i>-dispersion problem.
Comput. Ind. Eng., 2020

2019
Valid inequalities for concave piecewise linear regression.
Oper. Res. Lett., 2019

Effective methods for solving the Bi-criteria <i>p</i>-Center and <i>p</i>-Dispersion problem.
Comput. Oper. Res., 2019

2016
An integer programming approach for solving the p-dispersion problem.
Eur. J. Oper. Res., 2016

2015
p-Median and p-dispersion problems: A bi-criteria analysis.
Comput. Oper. Res., 2015

Determining Query Readiness for Structured Data.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2015

2013
An integer programming approach for the view and index selection problem.
Data Knowl. Eng., 2013

2012
The nearest point problem in a polyhedral set and its extensions.
Comput. Optim. Appl., 2012

Two-Stage Stochastic View Selection for Data-Analysis Queries.
Proceedings of the Advances in Databases and Information Systems, 2012

Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms.
Proceedings of the Advances in Databases and Information Systems, 2012

2011
An active index algorithm for the nearest point problem in a polyhedral cone.
Comput. Optim. Appl., 2011

2010
Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions.
Eur. J. Oper. Res., 2010

2009
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra.
Math. Program., 2009

Exact and inexact methods for solving the problem of view selection for aggregate queries.
Int. J. Bus. Intell. Data Min., 2009

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring.
Proceedings of the Advances in Databases and Information Systems, 2009

2008
Algorithms for the q-model clustering problem with application in switching cabinet manufacturing.
Eur. J. Oper. Res., 2008

Exact and inexact methods for selecting views and indexes for OLAP performance improvement.
Proceedings of the EDBT 2008, 2008

View and index selection for query-performance improvement: quality-centered algorithms and heuristics.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
Integer programming models for the q.
Eur. J. Oper. Res., 2007

2005
A Formal Model for the Problem of View Selection for Aggregate Queries.
Proceedings of the Advances in Databases and Information Systems, 2005

2004
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
Eur. J. Oper. Res., 2004

Heuristic methods for gang-rip saw arbor design.
Eur. J. Oper. Res., 2004

1991
SQVAM: A variance minimizing algorithm.
Oper. Res. Lett., 1991

1986
Affirmative action algorithms.
Math. Program., 1986

1982
A critical index algorithm for nearest point problems on simplicial cones.
Math. Program., 1982

1979
Computational complexity of LCPs associated with positive definite symmetric matrices.
Math. Program., 1979


  Loading...