Pages that link to "Item:Q1168215"

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

Displaying 50 items.

• Cardinality constraints and systems of restricted representatives (Q266031) (← links)
• Vertex cover meets scheduling (Q270025) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
• An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
• Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
• Assignment problems with complementarities (Q308621) (← links)
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• Even pairs in square-free Berge graphs (Q322216) (← links)
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
• Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274) (← links)
• Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
• Characterization of feedback Nash equilibria for multi-channel systems via a set of non-fragile stabilizing state-feedback solutions and dissipativity inequalities (Q364692) (← links)
• Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
• On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
• The cluster deletion problem for cographs (Q394219) (← links)
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
• Bilevel programming and the separation problem (Q403662) (← links)
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
• Packing cycles exactly in polynomial time (Q421271) (← links)
• On claw-free \(t\)-perfect graphs (Q431021) (← links)
• A constraint sampling approach for multi-stage robust optimization (Q445078) (← links)
• Regular inference as vertex coloring (Q465248) (← links)
• Distributionally robust multi-item newsvendor problems with multimodal demand distributions (Q494311) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
• Strict chordal and strict split digraphs (Q516787) (← links)
• Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
• Optimization with uniform size queries (Q527424) (← links)
• Duality for balanced submodular flows (Q581206) (← links)
• Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
• The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
• On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
• Static and dynamic routing under disjoint dominant extreme demands (Q631210) (← links)
• Hybrid tractability of valued constraint problems (Q646503) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
• Faster algorithms for security games on matroids (Q666676) (← links)
• Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
• A comparison of two edge-coloring formulations (Q688209) (← links)
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Exact localisations of feedback sets (Q722200) (← links)
• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• The indefinite period traveling salesman problem (Q724039) (← links)
• Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
• Social exchange networks with distant bargaining (Q744107) (← links)
• Stable sets and graphs with no even holes (Q745687) (← links)