Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

cut polyhedra

A counterexample to the dominating set conjecture

Published: 2005/12/21, Updated: 2006/04/01
  • Antoine Deza
  • Gabriel Indik
  • Categories Combinatorial Optimization, Polyhedra Tags cut polyhedra, dominating set conjecture, metric polyhedra

    The metric polytope m(n) is the polyhedron associated with all semimetrics on n nodes. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the metric polytope is adjacent to some integral vertex. The conjecture holds for n

    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity compressed sensing conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2023 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.