Progress in Combinatorial OptimizationWilliam R. Pulleyblank |
Contents
Lifting the Facets of Polyhedra | 3 |
Partitioning Spectra and Linear Programming 113 | 13 |
Oriented Matroids and Triangulations of Convex Polytopes 22 | 27 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
adjacent apply arcs arrow B₁ basic Meyniel graph bipartite graph bisimplicial box totally dual C₁ chain circuit clique cocircuit columns combinatorial optimization Computer connected components contains convex corresponding crossing family decomposition defined denote digraph directed graph disjoint dynamic graph edges Edmonds element ellipsoid method equivalent eulerian path exists facet feasible G(V₁ G₁ G₂ given graph G greedoid greedy algorithm Hence implies induced induced subgraph inequalities intersecting interval order K₁ lattice LEMMA Let G linear program linear system Lovász machines matching Math Mathematical matrix maximal maximum minimal network flow node NP-complete obtain oriented matroid pairs partial order partially ordered set partition path perfect graphs points polyhedra polyhedron polymatroid polynomial polytope proof result satisfies schedule Schrijver solve structure subgraph submodular function subsets supermodular theorem theory tion total dual integrality U₁ V₁ vector vertex vertices x₁ y₁