Solving the maximum duo-preservation string mapping problem with linear programming.
Wenbin ChenZhengzhang ChenNagiza F. SamatovaLingxi PengJianxiong WangMaobin TangPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- linear programming
- quadratic programming
- nonlinear programming
- integer programming problems
- linear programming problems
- simplex method
- linear program
- dynamic programming
- interior point algorithm
- lp relaxation
- np hard
- feasible solution
- simplex algorithm
- markov decision problems
- network flow
- maximum number
- regular expressions
- integer programming
- dual variables
- combinatorial optimization
- optimal solution
- primal dual
- interior point methods
- quadratic program