Multicommodity disconnecting set problem

MaRDI QIDQ5447759zbMATH OpenFDO

Authors

Publication date 20 March 2008

zbMATH Keywords

Approximation algorithmsPolytopeFacets, Branch-and-cutMulti-commodity network flowsMulti-cutsSet covering problem, Integer programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• Publication:4887740
• Disconnecting graphs by removing vertices: a polyhedral approach
• Directed Steiner problems with connectivity constraints
• Disjoint (s, t)‐cuts in a network
• A polyhedral approach to an integer multicommodity flow problem

Cited in

(5)

• An approach to the analysis of possible structural damages in multicommodity network systems
• scientific article; zbMATH DE number 913348 (Why is no real title available?)
• Disconnecting graphs by removing vertices: a polyhedral approach
• Considering the isolation set problem
• Analysis of budget for interdiction on multicommodity network flows

This page was built for publication: Multicommodity disconnecting set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447759)