What people are saying - Write a review
We haven't found any reviews in the usual places.
The Theory of CuttingPlanes
A Partial Order in the Solution Space of Bivalent Programs
11 other sections not shown
applied arbitrage arcs backtracking Balas bound algorithms branch and bound Christofides clique coefficients colouring columns combinatorial considered constraints corresponding cost currency current solution cutting plane cutting-plane defined denote dynamic programming edge example exists facet of P(G facet-producing feasible solution Figure finite given go to Step Gomory graph G Hamiltonian circuit heuristic implicit enumeration Integer Programming integer solution Jeroslow Karp knapsack problem linear program liquid loading lower bound Mathematical Programming matrix maximum method minimal minimum modular arithmetic Nemhauser node packing nonnegative NP-complete obtained Operations Research optimal solution optimum Padberg partitioning problem path polytope procedure relaxation route Section Set Covering Problem set packing set packing polytope simplex solving subadditive function subgradient subgradient method subgraph subproblems subset Table tanks technique Theorem travelling salesman problem unloading upper bound valid cut vector vehicle vertex vertices