Approximate Shifted Combinatorial Optimization


Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and diverse problems ranging from congestive to partitioning problems. In particular, every standard combinatorial optimization… (More)


Cite this paper

@article{Kouteck2017ApproximateSC, title={Approximate Shifted Combinatorial Optimization}, author={Martin Kouteck{\'y} and Asaf Levin and Syed M. Meesum and Shmuel Onn}, journal={CoRR}, year={2017}, volume={abs/1706.02075} }