On the directed cut cone and polytope (Q281821)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	On the directed cut cone and polytope	scientific article

Statements

scholarly article

On the directed cut cone and polytope (English)

Journal of Combinatorial Optimization

publication date

11 May 2016

zbMATH Keywords

combinatorial optimization

cut polytope

directed cut polytope

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s10878-015-9863-0

Disjunctive programming: Properties of the convex hull of feasible points

Solving LP Relaxations of Large-Scale Precedence Constrained Problems

An application of branch and cut to open pit mine scheduling

Directed metrics and directed graph partitioning problems

The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs

Geometry of cuts and metrics

Quasi-semi-metrics, oriented multi-cuts and related polyhedra

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Reducibility among Combinatorial Problems

NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT

On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency

Identifiers

zbMATH Open document ID

10.1007/s10878-015-9863-0

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:281821

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q281821&oldid=36248254"