A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.
K. SubramaniPiotr J. WojciechowskiPublished in: Algorithmica (2019)
Keyphrases
- computational complexity
- learning algorithm
- cost function
- worst case
- preprocessing
- k means
- np hard
- optimization algorithm
- multiple constraints
- constrained optimization
- dynamic programming
- benchmark problems
- simulated annealing
- similarity measure
- closed form
- expectation maximization
- particle swarm optimization
- linear programming
- search algorithm
- detection algorithm
- matching algorithm
- feasible solution
- convergence rate
- knapsack problem
- probabilistic model
- geometric constraints
- approximation ratio
- optimal solution
- min cost