Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods.
Masaki KimizukaSunyoung KimMakoto YamashitaPublished in: J. Glob. Optim. (2019)
Keyphrases
- linear programming
- methods can be applied
- practical problems
- convex optimization problems
- difficult problems
- convex optimization
- sparse linear systems
- search algorithm
- search methods
- solving problems
- solving complex
- significant improvement
- preprocessing
- quadratic program
- lower bound
- data mining techniques
- continuous variables
- dynamic programming
- np hard