17 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…
Li hua, Mu Dongmei, Yang Xinyu, Zhang Xinyue + 4 more
'Wang Dongxuan' 'Peng Hao' 'Wang Ying'] Background The size and cost of outpatient capacity directly affect the operational efficiency of a whole hospital. Many scholars have faced the study of outpatient capacity planning from an operations management perspective. Objective The outpatient service is refined, and the…
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…
Qiannan Tian, Jie Li, Guoxuan Huang, Wei Yuan + 1 more
In this paper, an airport ground service task assignment problem is studied. A task represents a service, which must be performed by one or multiple ground crew of a shift with required qualification/proficiency within a prescribed time period. For every assigned task, define “task priority” times “task duration” as…
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…
Chiu-Han Hsiao, Yean-Fu Wen, Frank Yeong-Sung Lin, Yu-Fang Chen + 5 more
'Yennun Huang' 'Yang-Che Su' 'Ya-Syuan Wu' 'Francesca Lonetti' 'Eda Marchetti'] Network slicing is a promising technology that network operators can deploy the services by slices with heterogeneous quality of service (QoS) requirements. However, an orchestrator for network operation with efficient slice resource…
Mikhail A. Bragin, Emily L. Tucker
Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible…
Tadashi Kadowaki, Mitsuru Ambai
In edge computing, suppressing data size is a challenge for machine learning models that perform complex tasks such as autonomous driving, in which computational resources (speed, memory size and power) are limited. Efficient lossy compression of matrix data has been introduced by decomposing it into the product of an…
Michiya Kuramata, Ryota Katsuki, Kazuhide Nakata, Gábor Vattay
Quantum annealing has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance. In recent years, with the technical development of quantum annealers, research on solving practical combinatorial optimization…
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…
Fereshteh Vaezi Jezeie, Seyed Jafar Sadjadi, Ahmad Makui, Seyedali Mirjalili
'Seyedali Mirjalili'] Portfolio optimization is one of the most important issues in financial markets. In this regard, the more realistic are assumptions and conditions of modelling to portfolio optimization into financial markets, the more reliable results will be obtained. This paper studies the knapsack-based…
David A. Liñán, Luis A. Ricardez-Sandoval
Mixed integer nonlinear programming (MINLP) in chemical engineering originated as a tool for solving optimal process synthesis and design problems. Since then, the application of MINLP has expanded to encompass control and operational decisions that are in line with the arising challenges faced by the industry, e.g.…
Yi Zheng, Ming Lei, Yijie Peng
Title: Graphical abstract
Qing Wang, Ashkan Memari
This paper studies the flexible large-scale supplier selection and order allocation problem with various quantity discounts, i.e., no discount, all-unit discount, incremental discount, and carload discount. It fills a literature gap that models usually formulate one or seldom two types because of the modeling and…
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…