Login / Signup
A polyhedral study of the semi-continuous knapsack problem.
Ismael Regis de Farias Jr.
Ming Zhao
Published in:
Math. Program. (2013)
Keyphrases
</>
knapsack problem
combinatorial optimization problems
machine learning
genetic algorithm
optimization problems
greedy algorithm
learning algorithm
lower bound
np hard
worst case
linear programming
higher dimensional
cutting plane
greedy heuristic