On the Connected Spanning Cubic Subgraph Problem

DOI10.1007/978-3-319-28186-5_10zbMath1370.90225OpenAlexW2487973867MaRDI QIDQ5354939

Damien Massé, Laurent Lemarchand, Reinhardt Euler

Publication date: 6 September 2017

Published in: Convexity and Discrete Geometry Including Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28186-5_10

zbMATH Keywords

branch and cut0--1 polytope0--1 programmingconnected spanning cubic subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph theory (05C99)

This page was built for publication: On the Connected Spanning Cubic Subgraph Problem