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.
- 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)
- A note on formulations for the \(A\)-partition problem on hypergraphs (Q1276964) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
- The maximum clique problem (Q1318271) (← links)
- Near-perfect matrices (Q1332310) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)