Convexification techniques for fractional programs
This paper develops a correspondence relating convex hulls of fractional functions with
those of polynomial functions over the same domain. Using this result, we develop a number …
those of polynomial functions over the same domain. Using this result, we develop a number …
Drone-delivery network for opioid overdose: Nonlinear integer queueing-optimization models and methods
We propose a new stochastic emergency network design model that uses a fleet of drones
to quickly deliver naloxone in response to opioid overdoses. The network is represented as …
to quickly deliver naloxone in response to opioid overdoses. The network is represented as …
Green supply chain design with emission sensitive demand: Second order cone programming formulation and case study
We propose a novel modeling framework for supply chain network design that models a
prevailing trend in consumer choice in which demand is impacted by carbon footprint. To …
prevailing trend in consumer choice in which demand is impacted by carbon footprint. To …
Solving a class of feature selection problems via fractional 0–1 programming
Feature selection is a fundamental preprocessing step for many machine learning and
pattern recognition systems. Notably, some mutual-information-based and correlation-based …
pattern recognition systems. Notably, some mutual-information-based and correlation-based …
Computing the Edge Expansion of a Graph using SDP
Computing the edge expansion of a graph is a famously hard combinatorial problem for
which there have been many approximation studies. We present two versions of an exact …
which there have been many approximation studies. We present two versions of an exact …
A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
Multiobjective linear fractional programming is useful to model multiobjective problems
where all or some of the objective functions are a ratio or proportion of one linear/affine …
where all or some of the objective functions are a ratio or proportion of one linear/affine …
Assortment Optimization Under History-Dependent Effects
T He, Y Zhang, H Zheng - arxiv preprint arxiv:2408.10967, 2024 - arxiv.org
This paper examines how to plan multi-period assortments when customer utility depends
on historical assortments. We formulate this problem as a nonlinear integer programming …
on historical assortments. We formulate this problem as a nonlinear integer programming …
The machine-part cell formation problem with non-binary values: A milp model and a case of study in the accounting profession
The traditional machine-part cell formation problem simultaneously clusters machines and
parts in different production cells from a zero–one incidence matrix that describes the …
parts in different production cells from a zero–one incidence matrix that describes the …
Competitive Facility Location under Random Utilities and Routing Constraints
In this paper, we study a facility location problem within a competitive market context, where
customer demand is predicted by a random utility choice model. Unlike prior research, which …
customer demand is predicted by a random utility choice model. Unlike prior research, which …
Fractional 0–1 programming and submodularity
In this note we study multiple-ratio fractional 0–1 programs, a broad class of NP-hard
combinatorial optimization problems. In particular, under some relatively mild assumptions …
combinatorial optimization problems. In particular, under some relatively mild assumptions …