Mixing Sets Linked by Bidirected Paths
From MaRDI portal
Publication:3225243
DOI10.1137/100811799zbMath1242.90129OpenAlexW2163984519MaRDI QIDQ3225243
Laurence A. Wolsey, Marco Di Summa
Publication date: 16 March 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4d2b4cffe94dbd64e862772f1dd971f33c744c05
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Fixed-charge transportation on a path: optimization, LP formulations and separation ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ The continuous knapsack set
This page was built for publication: Mixing Sets Linked by Bidirected Paths