scientific article; zbMATH DE number 5888310

zbMATH Open1217.05001MaRDI QIDQ2999656FDOQ2999656

Authors: Erika R. Bérczi-Kovács, László A. Végh 

Publication date: 16 May 2011

Title of this publication is not available (Why is that?)

Recommendations

• The theory of convex extensions in combinatorial optimization problems
• scientific article; zbMATH DE number 4145668
• scientific article; zbMATH DE number 4158391
• Grothendieck-type inequalities in combinatorial optimization
• Formalization and classification of combinatorial optimization problems
• Combinatorial optimization. Theory and algorithms
• Combinatorial optimization. Theory and algorithms
• Convex extensions in combinatorial optimization and their applications
• Convex combinatorial optimization
• Polyhedral proof methods in combinatorial optimization

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40) Structural characterization of families of graphs (05C75) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cited In (2)

• A Characterization of Combinatorial Demand
• The constructive characterization of \((k,l)\)-edge-connected digraphs

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 Q2999656)