12 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…
Aristeidis Mystakidis, Christos Koukaras, Paraskevas Koukaras, Konstantinos Kaparis + 3 more
'Konstantinos Kaparis' 'Stavros G. Stavrinides' 'Christos Tjortjis' 'Clara Benna'] Background/Objectives: This study addresses the complex challenge of Nurse Rostering (NR) in oncology departments, a critical component of healthcare management affecting operational efficiency and patient care quality. Given the…
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…
Martin Gonzalez, Jose J. López-Espín, Juan Aparicio, El-Ghazali Talbi + 1 more
'El-Ghazali Talbi' 'Nicholas Higham'] Mixed Integer Linear Programs (MILPs) are usually NP-hard mathematical programming problems, which present difficulties to obtain optimal solutions in a reasonable time for large scale models. Nowadays, metaheuristics are one of the potential tools for solving this type of problems…
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…
Esam H. Abdelhameed, Samah Abdelraheem, Yehia Sayed Mohamed, Ahmed A. Zaki Diab
'Ahmed A. Zaki Diab'] In this paper, the problem of scheduling smart homes (SHs) residential loads is considered aiming to minimize electricity bills and enhance the user comfort. The problem is addressed as a multi-objective constraint mixed-integer optimization problem (CP-MIP) to model the constrained load…
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…
Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl + 1 more
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. 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…
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…
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…
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…