11 papers · ranked by Valyu relevance
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
Approximate integer programming is the following: For a given convex body $K \subseteq{\mathbb{R}}^n$, either determine whether $K \cap{\mathbb{Z}}^n$ is empty, or find an integer point in the convex body $2\cdot K - c +c$ which is K, scaled by 2 from its center of gravity c. Approximate integer programming can be…
Marcin Briański, Martin Koutecký, Daniel Král’, Kristýna Pekárková + 1 more
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix A and the norm of the elements of its Graver basis. In particular, integer programming is fixed parameter tractable when parameterized by the primal…
K. H. Benjamin Leung, Nasrin Yousefi, Timothy C. Y. Chan, Ahmed M. Bayoumi
Putting the 4 components together, a general optimization model can be formulated as follows: maximize f ( x 1 , … , x n ; α 1 , … , α k ) subject to g i ( x 1 , … , x n ; α 1 , … , α k ) ≥ 0 , i = 1 , … , m This optimization model aims to maximize an objective function $f$ with $n$ decision variables $x_{1},…,x_{n}$…
Elisabeth Gaar, Markus Sinnl
The discrete -neighbor -center problem (d--CP) is an emerging variant of the classical -center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate facilities on these points in such a way that the maximum distance between each point where no…
Daniel Molina-Pérez, Edgar Alfredo Portilla-Flores, Efrén Mezura-Montes, Eduardo Vega-Alvarado + 2 more
'Efrén Mezura-Montes' 'Eduardo Vega-Alvarado' 'María Bárbara Calva-Yañez' 'Thomas Stützle'] Mixed integer nonlinear programming (MINLP) addresses optimization problems that involve continuous and discrete/integer decision variables, as well as nonlinear functions. These problems often exhibit multiple discontinuous…
Authors not listed
We present a vector-based method to balance chemical reactions. The algorithm builds candidates in a deterministic way, removes duplicates, and always prints coefficients in the lowest whole-number form. For redox cases, electrons and protons/hydroxide are treated explicitly, so both mass and charge are balanced. We…
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
A rational number is dyadic if it has a finite binary representation $p/2^k$, where p is an integer and k is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-point arithmetic on a computer. A vector is dyadic if all its entries are…
Authors not listed
Automated chemistry platforms hold the potential to enable large-scale organic synthesis campaigns, such as producing a library of compounds for biological evaluation. The efficiency of such platforms will depend on the schedule according to which the synthesis operations are executed. In this work, we study the…
Authors not listed
Experimental design plays an important role in efficiently acquiring informative data for system characterization and deriving robust conclusions under resource limitations. Recent advancements in high-throughput experimentation coupled with machine learning have notably improved experimental procedures. While Bayesian…
Qianxiang Ai, Joshua Schrier
In a recent paper in this journal (Chem. Mater. 2022, 34, 2545-2552), Twyman et al. studied the environmental stability of crystals by introducing a greedy heuristic algorithm for determining possible oxidation reactions. We show how the problem can be solved exactly, with less code and comparable computational time by…
Berhanu Belay, Adane Abebaw, Omar A. Alzubi
This manuscript presents a technique for solving a multiple-objective probabilistic fractional programming problem with discrete random variables. A multiple-objective probabilistic mathematical model is constructed with fractional objectives. In the model, some parameters of coefficients and right hand side parameters…