Login / Signup
The integration of an interior-point cutting plane method within a branch-and-price algorithm.
Samir Elhedhli
Jean-Louis Goffin
Published in:
Math. Program. (2004)
Keyphrases
</>
learning algorithm
objective function
computational complexity
optimal solution
interior point methods
cutting plane method
primal dual
semidefinite programming
dynamic programming
simulated annealing
analytic center
lower bound
convergence rate
knapsack problem
linear programming problems