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 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)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Optimization with additional variables and constraints (Q1779712) (← links)
- Transfer flow graphs (Q1801698) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- A computational study of several heuristics for the DRPP (Q1804375) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- On \({\mathbb{K}}^{\Delta}\) (Q1821691) (← links)
- A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- Orthogonally convex covering of orthogonal polygons without holes (Q1825650) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- A rounding technique for the polymatroid membership problem (Q1893104) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)