scientific article; zbMATH DE number 2118568

MaRDI QIDQ4828016zbMATH OpenFDO

Authors F. A. Sharifov

Publication date 24 November 2004

zbMATH Keywords

polytopeadmissible solutionstree-like networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• A characterization of the uncapacitated network design polytope
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• On survivable network polyhedra
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Network design problem with cut constraints

Cited in

(1)

• Polyhedral structure of the 4-node network design problem

This page was built for publication:

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