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 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)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- Data-driven robust optimization (Q1702776) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Network pollution games (Q1755784) (← 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)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← 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)