Learning Solutions of Similar Linear Programming Problems using Boosting Trees
In many optimization problems, similar linear programming (LP) problems occur in the nodes of the branch and bound trees that are used to solve integer (mixed or pure, deterministic or stochastic) programming problems. Similar LP problems are also found in problem domains where the objective functio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/1721.1/58609 |