Minimal arc-sets spanning dicycles

DOI10.1016/j.dam.2017.02.011zbMath1383.05129OpenAlexW2600328567MaRDI QIDQ1707911

Denis Cornaz, Ali Ridha Mahjoub, Hervé L. M. Kerivin

Publication date: 4 April 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.011

zbMATH Keywords

0-1 programmingdirected cyclesminimal forbidden structureSherali-Adams's linearization

Mathematics Subject Classification ID

Linear programming (90C05) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Chromatic characterization of biclique covers
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• The Maximum Induced Bipartite Subgraph Problem with Edge Weights
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

This page was built for publication: Minimal arc-sets spanning dicycles