Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.
Robert BredereckPiotr FaliszewskiRolf NiedermeierPiotr SkowronNimrod TalmonPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- mixed integer programming
- convex concave
- mixed integer
- valid inequalities
- convex hull
- column generation
- lot sizing
- binary variables
- lagrangian relaxation
- linear program
- feasible solution
- optimal solution
- production planning
- linear programming
- multistage
- lower and upper bounds
- np hard
- lower bound
- computational complexity