Works (41)
Updated: April 4th, 2024 16:21
2023 journal article
Bi-criteria set covering problem with conflict constraints
COMPUTERS & INDUSTRIAL ENGINEERING, 186.
author keywords: Set covering; Stable set; Integer programming; Valid inequalities; Heuristics
Sources: Web Of Science, NC State University Libraries
Added: January 2, 2024
2022 journal article
Set covering problem with conflict constraints
COMPUTERS & OPERATIONS RESEARCH, 143.
author keywords: Set covering; Stable set; Integer programming; Valid inequalities; Pre-processing
www.lib.ncsu.edu (repository)
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: May 23, 2022
2020 journal article
Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem
COMPUTERS & INDUSTRIAL ENGINEERING, 146.
author keywords: Bi-criteria optimization; Representative subset; Location theory; Max-min diversity; p-median partitioning
TL;DR:
A new criterion (index) is introduced to evaluate the effectiveness of a representative subset of non-dominated points in the context of the Bi-criteria p-Median p-Dispersion problem (BpMD) and provides an upper bound on the relative gap between the representing NDP and any NDP that it represents.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 3, 2020
2019 journal article
Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem
COMPUTERS & OPERATIONS RESEARCH, 101, 43–54.
author keywords: Location; Max-min diversity; p-center partitioning; Integer programming; Valid inequalities
TL;DR:
An integer programming (IP) model is proposed and a corresponding incremental algorithm is proposed to find the non-dominated frontier for this bi-criteria optimization problem and a new family of valid inequalities for the corresponding IP models that are potentially effective when solving large instances of these models are proposed.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: November 26, 2018
2019 journal article
Valid inequalities for concave piecewise linear regression
OPERATIONS RESEARCH LETTERS, 47(1), 52–58.
author keywords: Concave regression; Piecewise linear fitting; Valid inequalities; Clearing function
TL;DR:
Results with univariate data show that the proposed valid inequalities improve the root relaxation lower bound, permitting significant improvements in solution time.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: February 18, 2019
2016 journal article
An integer programming approach for solving the p-dispersion problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 253(1), 216–225.
author keywords: Location problem; Max-min diversity; Integer programming; Traffic sensor location
TL;DR:
This work defines a collection of node packing problems associated with each instance of this problem and employs existing integer programming techniques, i.e., branch-and-bound and strong valid inequalities, to solve these nodes packing problems.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2015 chapter
Determining Query Readiness for Structured Data
In Big Data Analytics and Knowledge Discovery (Vol. 9263, pp. 3–14).
Contributors: F. Alborzi n, R. Chirkova n, J. Doyle n & n
author keywords: Big data quality; Big data analytics and user interfaces; Data readiness level; Data quality measurement; Data quality improvement
TL;DR:
This study provides a formalization of DRL in a structured-data scenario, and illustrates how knowledge of rules and facts can be used to identify those transformations of the data that improve its DRL.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: Crossref, ORCID
Added: December 6, 2019
2015 conference paper
Determining query readiness for structured data
Big data analytics and knowledge discovery, 9263, 3–14.
Source: NC State University Libraries
Added: August 6, 2018
2015 journal article
p-Median and p-dispersion problems: A bi-criteria analysis
COMPUTERS & OPERATIONS RESEARCH, 61, 46–55.
author keywords: Location theory; Max-min diversity; p-Median partitioning; Integer programming; Lagrangian heuristic
TL;DR:
This work studies this problem as a multi-objective optimization problem and proposes an iterative algorithm to obtain its non-dominated frontier and proposes a Lagrangian heuristic algorithm for solving larger instances of this problem.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2014 journal article
Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement
MATHEMATICAL PROBLEMS IN ENGINEERING, 2014.
TL;DR:
This paper extends the resource constrained project scheduling problem (RCPSP) by this resource type (RCpsP-NR) and customize four basic branch and bound algorithms of RCPSP for it, including precedence tree, extension alternatives, minimal delaying alternatives, and minimal forbidden sets.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 journal article
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering, 83, 111–125.
author keywords: Business intelligence; Data warehouse and repository; OLAP; Materialized views; View and index selection; Integer programming; Heuristics
TL;DR:
This work proposes an integer programming model for the OLAP view- and index-selection problem and uses heuristic strategies to further reduce the size of this IP model and dramatically reduce its execution time, although it no longer guarantees that the reduced IP model offers a globally optimal solution for the original problem.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2013 journal article
Locating Traffic Sensors on a Highway Network Models and Algorithms
TRANSPORTATION RESEARCH RECORD, (2339), 30–38.
TL;DR:
A new Lagrangian heuristic algorithm is presented for solving large instances of this problem when a budget constraint is imposed and it is shown that this algorithm provides solutions for large-scale networks within reasonable execution times.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 chapter
Two-Stage Stochastic View Selection for Data-Analysis Queries
In Advances in Intelligent Systems and Computing (pp. 115–123).
TL;DR:
This work considers the problem of selecting an optimal set of views to answer a given collection of queries at the present time as a two-stage stochastic programming problem and shows that this model is equivalent to an integer programming (IP) model that can be solved via various commercial IP solvers.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2013 conference paper
Two-stage stochastic view selection for data-analysis queries
Advances in databases and information systems, 186, 115–123.
Source: NC State University Libraries
Added: August 6, 2018
2012 journal article
A Markov Chain Framework for Cycle Time Approximation of Toolsets
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 25(4), 589–597.
author keywords: Markov processes; queueing analysis; stochastic processes
TL;DR:
A Markov chain framework is proposed that attempts to approximate the cycle time of a toolset in the presence of informal operational rules, and it is compared with classical queueing models through a series of numerical examples.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
12. Responsible Consumption and Production
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2012 journal article
An efficient model for the crosscut optimisation problem in a wood processing mill
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 50(2), 485–497.
author keywords: dynamic programming; cutting stock problem; cutting lumber
TL;DR:
A novel approach for matching the pattern of defects on all four surfaces of an incoming strip of wood with the surface requirements of the cut-pieces as specified in a given cut-bill, and determine an effective cutting pattern for each incoming strip accordingly.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2012 chapter
Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms
In Advances in Databases and Information Systems (pp. 195–208).
TL;DR:
This work poses the view-selection problem as an integer programming model, study its structural properties, and proposes effective techniques for reducing the search space of views and thus the size of the corresponding IP model.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2012 journal article
The nearest point problem in a polyhedral set and its extensions
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 53(1), 115–130.
author keywords: Quadratic programming; Pos cone; Projection face; Active constraint
TL;DR:
This approach can be employed to minimize any strictly convex quadratic function over a polyhedral set and is shown to be more effective than other existing methods for solving these problems.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2011 journal article
An active index algorithm for the nearest point problem in a polyhedral cone
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 49(3), 435–456.
author keywords: Quadratic programming; Pos cone; Projection face; Active constraint
TL;DR:
This work studies the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones, and designs an efficient algorithm for solving the problem, and carries out computational experiments to evaluate its effectiveness.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2011 article
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.
author keywords: Production planning; Linear programming; Clearing functions; Dual prices; Marginal prices
UN Sustainable Development Goal Categories
12. Responsible Consumption and Production
(Web of Science)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018
2010 journal article
An optimal and near-optimal strategy to selecting individuals for transfer in captive breeding programs
BIOLOGICAL CONSERVATION, 143(11), 2858–2863.
author keywords: Minimum kinship; Maximum genetic diversity; Relocation; Reintroductions
TL;DR:
A quadratic integer programming (IP) model is proposed to identify a group of individuals to transfer that maximizes genetic diversity within two subpopulations and a local improvement algorithm (LIA) is developed to efficiently provide near-optimal solutions when the number of transferred individuals increases.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
15. Life on Land
(Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2010 journal article
Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 207(1), 105–109.
author keywords: Integer programming; Mixed integer rounding; Group problem; Polyhedra; Facet
TL;DR:
It is shown that the n-step MIR functions also directly generate facets for the finite master cyclic group polyhedra especially in many cases where the breakpoints of the NIR function are not necessarily at the elements of the group.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2009 journal article
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra
MATHEMATICAL PROGRAMMING, 120(2), 313–346.
author keywords: Mixed integer rounding; Mixed integer programming; Infinite group polyhedron; Valid inequality; Facet
TL;DR:
It is proved that the n-step MIR inequalities generate two-slope facets for the infinite group polyhedra, and hence are potentially strong.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2009 chapter
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
In Advances in Databases and Information Systems (pp. 133–148).
TL;DR:
This work proposes a framework and algorithms that enable selection of views/indexes that contribute to the most efficient plans for the input queries, subject to the space bound, and presents strong optimality guarantees on the architecture.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2008 article
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.
author keywords: clustering; combinatorial optimization; electronics manufacturing; heuristic methods; tabu search
TL;DR:
Three heuristic algorithms are proposed for solving the q-model configuration problem and a computational experiment is carried out to evaluate their effectiveness.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2007 journal article
A very large scale neighborhood search algorithm for the q-mode problem
IIE TRANSACTIONS, 39(10), 971–984.
author keywords: cluster analysis; data mining; local search/local improvement
TL;DR:
A neighborhood search algorithm is proposed for solving the q-mode problem based on a very large scale neighborhood that is implicitly searched using network flow techniques and shows that in instances with strong natural clusters the algorithm consistently finds optimal or near-optimal solutions.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2007 journal article
Integer programming models for the q-mode problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 182(2), 612–625.
author keywords: integer programming; linear programming; cluster analysis; data mining
TL;DR:
The q-mode problem is a combinatorial optimization problem that requires partitioning of objects into clusters and an existing mixed integer programming model for this problem is discussed and alternative models and enhancements are offered.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2005 chapter
A Formal Model for the Problem of View Selection for Aggregate Queries
In Advances in Databases and Information Systems (pp. 125–138).
TL;DR:
This paper uses an integer-programming model to obtain optimal solutions to the problem of view selection for aggregate queries on data warehouses and reports the results of the post-optimality analysis that was performed to determine the impact of changing certain input characteristics on the optimal solution.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2004 journal article
A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 155(2), 380–401.
author keywords: flowshop scheduling; parallel machines; buffer constraints; minimizing makespan
TL;DR:
A tabu search algorithm is developed for the problem of scheduling N jobs on parallel machines in L successive stages with limited buffer capacities between stages, and a procedure to construct a complete schedule associated with every permutation vector is proposed.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
12. Responsible Consumption and Production
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2004 journal article
Algorithms for the model configuration problem
IIE TRANSACTIONS, 36(2), 169–180.
TL;DR:
This work discusses the manufacturing environment and defines the q-model problem, and proposes several heuristic procedures for solving the 2-modelproblem, and presents an evaluation of these procedures through an extensive computational experiment.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2004 journal article
Heuristic methods for gang-rip saw arbor design
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 154(3), 626–640.
author keywords: lumber cutting; combinatorial optimization; computational complexity; heuristics
TL;DR:
Several heuristic procedures for solving the problem of design and scheduling of arbors for a computer assisted gang-rip saw system, based on the principles of local improvement, simulated annealing, and genetic algorithms are developed.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2003 journal article
Statistical tolerancing using designed experiments in a noisy environment
COMPUTERS & INDUSTRIAL ENGINEERING, 44(3), 515–526.
author keywords: statistical tolerancing; design of experiment; moment estimation; noisy experiments; mixture distribution
TL;DR:
It is observed that presence of random error in the experiment environment could introduce bias in the moment estimators and increases their respective variances, and proposes adjustments to the method that would reduce the bias as well as the variance of these estimators.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2002 journal article
Heuristic procedures for the parallel machine problem with tool switches
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 40(1), 151–164.
TL;DR:
This work addresses the problem of scheduling a set of parts with given processing times and tool requirements on m identical parallel machines, and three heuristic procedures are proposed for solving it.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(OpenAlex)
12. Responsible Consumption and Production
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2001 journal article
A mathematical model and a heuristic procedure for the robust design problem with high-low tolerances
IIE Transactions, 33(12), 1121–1127.
TL;DR:
The concept of robust design in the context of high-low tolerancing is introduced and a mathematical programming model for it is proposed and this model can be solved using conventional non-linear programming techniques.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2001 journal article
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.
TL;DR:
A constrained system optimum combined trip distribution and assignment problem was selected and a mathematical formulation for the selected problem has been developed and a methodology for applying cellular automata has been presented.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2000 journal article
Parametric design and optimization for a nonlinear precision X-Y microstage
JOURNAL OF MANUFACTURING SYSTEMS, 19(4), 229–238.
author keywords: kinematic coupling; mechanical advantage; positioning; micropositioning; robust design; mechanism; design optimization
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
1999 journal article
On the sensitivity of project variability to activity mean duration
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 62(3), 219–232.
author keywords: activity networks; Taguchi sampling; sensitivity analysis
TL;DR:
The main contribution of this paper is to study the impact of changing the mean duration of an activity on the variability of the project duration, and investigate the accuracy of Taguchi's sampling technique as a method for analyzing the network.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
1998 journal article
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.
author keywords: off-line quality control; quality engineering; parameter design; robust design; design optimization; textiles dyeing; colour control
TL;DR:
This method is used to identify optimal batch dyeing process parameter settings, which produce target colour with the least colour variation within and among dyed fabric pieces, which are formulated and solved as a nonlinear programming problem.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
2. Zero Hunger
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
1998 journal article
Design of economical noise array experiments for a partially controlled simulation environment
Computers & Industrial Engineering, 35(3-4), 555–558.
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
1997 journal article
A linear approximation model for the parameter design problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 97(3), 561–570.
author keywords: quality; modelling; nonlinear programming; manufacturing
UN Sustainable Development Goal Categories
2. Zero Hunger
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
1997 journal article
Alternative manufacturing sequences and tolerance buildup: A point of view and a case study
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 35(1), 123–136.
UN Sustainable Development Goal Categories
12. Responsible Consumption and Production
(Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
