## An implicit enumeration algorithm with binary-valued constraintsStanford University, 1986 - 214 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

0-branch BB algorithm binary variables branch and bound branching schemes BVC's Chapter choice knapsack problem coefficients computational results contingent variables CPU Time Seconds criterion cutting plane efficiency enumeration tree example fathoming tests feasible region defined feasible solution formulation free variables GCC's Geoffrion group contingent constraint heuristic algorithms heuristic procedure Integer Linear Programming integer programming problems introduce iteration key variable Linear Programming maximum number MCIP problem MCIP/BVC algorithm MCIP/BVC problems Mixed Integer Mixed Integer Programming multiple choice constraints multiple choice knapsack node number of binary-valued Number of Improvements number of potential number of variables objective function Operations Research optimal solution original problem partition penalty potential branches primary variables procedure H3 projects proposed algorithm road section selected simplex algorithm special ordered sets special structure special-purpose step G8 subgradient method Table testing problems Testing Results tightness ratio Traveling Salesman Problem type SS constraints Update valued constraints Zopt