Pages that link to "Item:Q1168215"

The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):

Displaying 50 items.

• Multiline addressing by network flow (Q1016524) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• A family of easy polyhedra (Q1040728) (← links)
• Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
• A note on submodular set cover on matroids (Q1045066) (← links)
• The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
• Decomposition of submodular functions (Q1053717) (← links)
• Brick decompositions and the matching rank of graphs (Q1055426) (← links)
• Testing membership in matroid polyhedra (Q1056350) (← links)
• Graph isomorphism and theorems of Birkhoff type (Q1068104) (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
• Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
• Intelligent gradient search in linear programming (Q1071647) (← links)
• Small solutions of linear diophantine equations (Q1074620) (← links)
• Relaxations of vertex packing (Q1078206) (← links)
• Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
• A 71/60 theorem for bin packing (Q1083194) (← links)
• On randomized stopping points and perfect graphs (Q1085176) (← links)
• Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
• Coloring planar perfect graphs by decomposition (Q1093649) (← links)
• On a conjecture of Meyniel (Q1096652) (← links)
• Matrices with the Edmonds-Johnson property (Q1100483) (← links)
• An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
• The Schrijver system of odd join polyhedra (Q1101352) (← links)
• On submodular function minimization (Q1104332) (← links)
• Locally perfect graphs (Q1105623) (← links)
• The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
• Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
• A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
• Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
• A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
• Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• A cutting plane algorithm for a clustering problem (Q1122492) (← links)
• Complexity of linear programming (Q1165154) (← links)
• Minimization on submodular flows (Q1167658) (← links)
• Weakly bipartite graphs and the max-cut problem (Q1169411) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• The complexity of controlled selection (Q1173958) (← links)
• The principal lattice of partitions of a submodular function (Q1174311) (← links)
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
• COSINE: A new graph coloring algorithm (Q1180823) (← links)
• A polyhedral approach to edge coloring (Q1180838) (← links)