scientific article; zbMATH DE number 5173821

zbMath1118.90022MaRDI QIDQ5294047

Michel Minoux

Publication date: 23 July 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relaxationbranch and cutmixed integer programmingnetwork designmulticommodity flowsconstraint generationcutting-planes

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (5)

Chance-constrained problems and rare events: an importance sampling approach ⋮ Component importance measures for multi-industry vulnerability of a freight transportation network ⋮ Routing and scheduling of network flows with deadlines and discrete capacity allocation ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Experiments on virtual private network design with concave capacity costs

This page was built for publication: