A new improved model of marine predator algorithm for optimization problems

M Ramezani, D Bahmanyar, N Razmjooy - Arabian Journal for Science …, 2021 - Springer
The marine predator algorithm is a new nature-inspired metaheuristic algorithm that mimics
biological interaction between marine predators and prey. It has been also stated from the …

Markov bases: a 25 year update

F Almendra-Hernández, JA De Loera… - Journal of the American …, 2024 - Taylor & Francis
In this article, we evaluate the challenges and best practices associated with the Markov
bases approach to sampling from conditional distributions. We provide insights and …

A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path

S Dong, YT Lee, G Ye - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
Arising from structural graph theory, treewidth has become a focus of study in fixed-
parameter tractable algorithms. Many NP-hard problems are known to be solvable in O (n· 2 …

Voting and bribing in single-exponential time

D Knop, M Koutecký, M Mnich - ACM Transactions on Economics and …, 2020 - dl.acm.org
We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery
problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is …

Block-structured integer and linear programming in strongly polynomial and near linear time

J Cslovjecsek, F Eisenbrand, C Hunkenschröder… - Proceedings of the 2021 …, 2021 - SIAM
We consider integer and linear programming problems for which the linear constraints
exhibit a (recursive) block-structure: The problem decomposes into independent and …

Demand response application as a service: An SDN-based management framework

A Montazerolghaem… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
With an increase in the utilization of appliances, meeting the energy demand of consumers
by traditional power grids is an important issue. The success of Demand Response (DR) …

Near-Linear Time Algorithm for -Fold ILPs via Color Coding

K Jansen, A Lassota, L Rohwedder - SIAM Journal on Discrete Mathematics, 2020 - SIAM
We study an important case of integer linear programs (ILPs) of the form \max{c^Tx\vert\
mathcalAx=b,l≦x≦u,\,x∈Z^nt\} with nt variables and lower and upper bounds …

Tight complexity lower bounds for integer linear programming with few constraints

D Knop, M Pilipczuk, M Wrochna - ACM Transactions on Computation …, 2020 - dl.acm.org
We consider the standard ILP Feasibility problem: given an integer linear program of the
form {A x= b, x⩾ 0}, where A is an integer matrix with k rows and ℓ columns, x is a vector of ℓ …

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

J Cslovjecsek, F Eisenbrand, M Pilipczuk… - arXiv preprint arXiv …, 2020 - arxiv.org
We consider the problem of solving integer programs of the form $\min\{\, c^\intercal
x\\colon\Ax= b, x\geq 0\} $, where $ A $ is a multistage stochastic matrix in the following …

[HTML][HTML] Integer programming in parameterized complexity: Five miniatures

T Gavenčiak, M Koutecký, D Knop - Discrete Optimization, 2022 - Elsevier
Powerful results from the theory of integer programming have recently led to substantial
advances in parameterized complexity. However, our perception is that, except for Lenstra's …