84 citations · 241 across the 22 of their papers we have counts for
5 papers · 1 filter
Multitype Integer Monoid Optimization and Applications
Dušan Knop, Martin Koutecký, Asaf Levin +2
Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems since the pioneering work of Gilmore and Gomory [Oper. Res., 19…
Approximation schemes for the generalized extensible bin packing problem
Asaf Levin
We present a new generalization of the extensible bin packing with unequal bin sizes problem. In our generalization the cost of exceeding the bin size depends on the index of the b…
Online Bin Covering with Limited Migration
Sebastian Berndt, Leah Epstein, Klaus Jansen +3
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is ofte…
An Algorithmic Theory of Integer Programming
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein +3
We study the general integer programming problem where the number of variables is a variable part of the input. We consider two natural parameters of the constraint matrix :…
Hypergraphic Degree Sequences are Hard
Antoine Deza, Asaf Levin, Syed M. Meesum +1
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.