Infinitely many sign-changing solutions for p-Laplacian Neumann problems with indefinite weight.
Tieshan HeChuanyong ChenYehui HuangChaojun HouPublished in: Appl. Math. Lett. (2015)
Keyphrases
- benchmark problems
- similar problems
- edge detection
- np complete
- combinatorial problems
- optimal solution
- computational issues
- finite element
- practical solutions
- data sets
- approximate solutions
- greedy algorithms
- exact solution
- combinatorial optimisation
- approximation schemes
- optimal or near optimal
- boundary conditions
- constraint programming
- decision problems
- decision trees