3 citations · 3 across the 4 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 3 cited
On local search and LP and SDP relaxations for k-Set Packing
Tim Oosterwijk
Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching a…
math.OC2015
High Multiplicity Scheduling with Switching Costs for few Products
Michaël Gabay, Alexander Grigoriev, Vincent J. C. Kreuzen +1
We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and…