Login / Signup
On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems.
Xuan Vinh Doan
Karthik Natarajan
Published in:
Oper. Res. (2012)
Keyphrases
</>
combinatorial optimization problems
optimization problems
combinatorial optimization
knapsack problem
worst case
metaheuristic
ant colony optimization
discrete optimization
traveling salesman problem
shortest path problem
job shop scheduling
upper bound
bayesian networks
probabilistic model
generative model
exact algorithms
regression model
lower bound
computational complexity
job shop scheduling problem
min cost
continuous optimization problems
vehicle routing problem
probability distribution
evolutionary algorithm
data structure