Yahya Fathi

Set covering problem with conflict constraints

COMPUTERS & OPERATIONS RESEARCH, 143.

Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem

COMPUTERS & INDUSTRIAL ENGINEERING, 146.

Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem

COMPUTERS & OPERATIONS RESEARCH, 101, 43–54.

Valid inequalities for concave piecewise linear regression

OPERATIONS RESEARCH LETTERS, 47(1), 52–58.

An integer programming approach for solving the p-dispersion problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 253(1), 216–225.

Determining Query Readiness for Structured Data

In Big Data Analytics and Knowledge Discovery (Vol. 9263, pp. 3–14).

Determining query readiness for structured data

Big data analytics and knowledge discovery, 9263, 3–14.

p-Median and p-dispersion problems: A bi-criteria analysis

COMPUTERS & OPERATIONS RESEARCH, 61, 46–55.

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

MATHEMATICAL PROBLEMS IN ENGINEERING, 2014.

An integer programming approach for the view and index selection problem

Data & Knowledge Engineering, 83, 111–125.

Locating Traffic Sensors on a Highway Network Models and Algorithms

TRANSPORTATION RESEARCH RECORD, (2339), 30–38.

Two-Stage Stochastic View Selection for Data-Analysis Queries

In Advances in Intelligent Systems and Computing (pp. 115–123).

Two-stage stochastic view selection for data-analysis queries

Advances in databases and information systems, 186, 115–123.

A Markov Chain Framework for Cycle Time Approximation of Toolsets

IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 25(4), 589–597.

An efficient model for the crosscut optimisation problem in a wood processing mill

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 50(2), 485–497.

Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms

In Advances in Databases and Information Systems (pp. 195–208).

The nearest point problem in a polyhedral set and its extensions

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 53(1), 115–130.

An active index algorithm for the nearest point problem in a polyhedral cone

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 49(3), 435–456.

Using a mathematical programming model to examine the marginal price of capacitated resources

Kefeli, A., Uzsoy, R., Fathi, Y., & Kay, M. (2011, May). INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, Vol. 131, pp. 383–391.

An optimal and near-optimal strategy to selecting individuals for transfer in captive breeding programs

BIOLOGICAL CONSERVATION, 143(11), 2858–2863.

Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 207(1), 105–109.

Generalized mixed integer rounding inequalities: facets for infinite group polyhedra

MATHEMATICAL PROGRAMMING, 120(2), 313–346.

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring

In Advances in Databases and Information Systems (pp. 133–148).

Algorithms for the q-model clustering problem with application in switching cabinet manufacturing

Morgan, S. D., & Fathi, Y. (2008, September 16). EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, Vol. 189, pp. 939–951.

A very large scale neighborhood search algorithm for the q-mode problem

IIE TRANSACTIONS, 39(10), 971–984.

Integer programming models for the q-mode problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 182(2), 612–625.

A Formal Model for the Problem of View Selection for Aggregate Queries

In Advances in Databases and Information Systems (pp. 125–138).

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 155(2), 380–401.

Algorithms for the model configuration problem

IIE TRANSACTIONS, 36(2), 169–180.

Heuristic methods for gang-rip saw arbor design

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 154(3), 626–640.

Statistical tolerancing using designed experiments in a noisy environment

COMPUTERS & INDUSTRIAL ENGINEERING, 44(3), 515–526.

Heuristic procedures for the parallel machine problem with tool switches

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 40(1), 151–164.

A mathematical model and a heuristic procedure for the robust design problem with high-low tolerances

IIE Transactions, 33(12), 1121–1127.

Meta-optimization using cellular automata with application to the combined trip distribution and assignment system optimal problem

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 16(6), 384–398.

Parametric design and optimization for a nonlinear precision X-Y microstage

JOURNAL OF MANUFACTURING SYSTEMS, 19(4), 229–238.

On the sensitivity of project variability to activity mean duration

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 62(3), 219–232.

A case study in off-line quality control: characterization and optimization of batch dyeing process design

INTERNATIONAL JOURNAL OF TECHNOLOGY MANAGEMENT, 16(4-6), 358–382.

Design of economical noise array experiments for a partially controlled simulation environment

Computers & Industrial Engineering, 35(3-4), 555–558.

A linear approximation model for the parameter design problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 97(3), 561–570.

Alternative manufacturing sequences and tolerance buildup: A point of view and a case study

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 35(1), 123–136.