Using dual network bounds in algorithms for solving generalized set packing partitioning problems.
Naum Z. ShorYu. V. VoitishinV. M. GlushkovPublished in: Comput. Optim. Appl. (1996)
Keyphrases
- partial solutions
- optimization problems
- combinatorial optimization
- lower and upper bounds
- solving problems
- quadratic optimization problems
- convex optimization problems
- lower bound
- problems in artificial intelligence
- polynomial time complexity
- benchmark problems
- randomized algorithms
- constrained problems
- global optimization problems
- resource constrained project scheduling problem
- error bounds
- packing problem
- worst case
- search heuristics
- suboptimal solutions
- sufficient statistics
- upper bound
- np complete problems
- complex networks
- exact and approximate
- evolutionary algorithm
- np complete
- stochastic shortest path
- eigenvalue problems
- learning algorithm
- network flow problem
- distributed constraint optimization problems
- upper and lower bounds
- peer to peer
- minimum cost
- convex optimization
- network structure