Bounds for probabilistic integer programming problems.
Darinka DentchevaAndrás PrékopaAndrzej RuszczynskiPublished in: Discret. Appl. Math. (2002)
Keyphrases
- integer programming problems
- artificial bee colony algorithm
- linear programming
- cutting plane
- probabilistic model
- upper bound
- bayesian networks
- particle swarm optimization algorithm
- branch and bound
- lower bound
- worst case
- search space
- artificial neural networks
- neural network
- lower and upper bounds
- search algorithm
- optimal solution