What people are saying - Write a review
We haven't found any reviews in the usual places.
Integer Programming Theory
Test Sets and Inequalities for Integer Programs
An Optimal Stable Continued Fraction Algorithm
31 other sections not shown
Other editions - View all
acyclic apply approximation algorithm assume binary clutter bipartite branch-and-bound coloring colourful set column combinatorial commodity completion compute consider contains convex corresponding cycle defined denote dual eigenvalue equal exists feasible solution feedback vertex set flow problem formulation GD GD given graph G Hence heuristic hypergraph IMCF implementation implies improved instances integer programming intersection iteration Lagrangian Lemma length function linear programming lower bound LP relaxation machine Mathematics matrix matroid maximum method minimal minimum node non-negative nonzero NP-hard obtained OFOC optimal solution pair partition performance guarantee permutation planar planar graphs polyhedron polynomial polytope Proof Proposition quadratic random randomized rounding release dates rows satisfies SCFA schedule Section semidefinite semidefinite programming set covering Set Covering Problem shortest path shortest path problem solved spanning tree submodular subproblem subset supermodular Theorem Toeplitz matrix upper bound valid inequalities variables vector vertex set vertices weight