Lower bounds for integer programming problems
Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the alg...
Main Author: | Li, Yaxian |
---|---|
Other Authors: | Nemhauser, George L. |
Format: | Others |
Language: | en_US |
Published: |
Georgia Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/48959 |
Similar Items
-
Lifted inequalities for 0-1 mixed integer programming
by: Richard, Jean-Philippe P.
Published: (2008) -
Single-row mixed-integer programs: theory and computations
by: Fukasawa, Ricardo
Published: (2008) -
Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
by: Elias Munapo
Published: (2020-04-01) -
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01) -
Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
by: Elias Munapo, et al.
Published: (2016-12-01)