Pricing-based primal and dual bounds for selected packing problems.
Andrea PizzutiPublished in: 4OR (2021)
Keyphrases
- packing problem
- duality gap
- primal dual
- exact penalty
- dc programming
- dual formulation
- bin packing
- augmented lagrangian
- lower and upper bounds
- lagrangian dual
- dual variables
- convex programming
- linear programming
- linear program
- lower bound
- algorithm for linear programming
- mixed integer linear program
- upper bound
- support vector
- objective function
- optimal solution
- integer programming
- convergence rate
- cutting stock
- set covering problem
- convex optimization
- inequality constraints
- simplex algorithm
- constrained optimization problems
- higher dimensional