Pages that link to "Item:Q1168215"
From MaRDI portal
The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):
Displayed 50 items.
- 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)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
- Stability number and chromatic number of tolerance graphs (Q1186162) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Paths on polymatroids (Q1196722) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Applications of combinatorics to statics --- a second survey (Q1201249) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- Optimal multiple interval assignments in frequency assignment and traffic phasing (Q1208449) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- The optimal path-matching problem (Q1272178) (← links)