On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs.
Mourad BaïouFrancisco BarahonaPublished in: Discret. Optim. (2016)
Keyphrases
- facet defining inequalities
- directed graph
- facet defining
- planar graphs
- subtour elimination
- hamiltonian cycle
- valid inequalities
- convex hull
- lattice points
- graph databases
- graph mining
- undirected graph
- graph theoretic
- median graph
- graph matching
- sufficient conditions
- median filter
- traveling salesman problem
- mixed integer
- weighted graph
- knapsack problem
- bipartite graph
- subgraph isomorphism
- graph structure
- linear inequalities
- finite number
- semidefinite
- linear programming
- graph model