scientific article; zbMATH DE number 1786505

zbMATH Open0998.52014MaRDI QIDQ4547798FDOQ4547798

Authors: Antoine Deza, Komei Fukuda, Masanori Sato, Dmitrii V. Pasechnik 

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980125

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

Recommendations

• On the face lattice of the metric polytope
• scientific article; zbMATH DE number 665696
• Generalized cut and metric polytopes of graphs and simplicial complexes
• scientific article; zbMATH DE number 718853
• Improved compact formulations for metric and cut polyhedra

zbMATH Keywords

combinatorial optimization problemsconvex polyhedrametric polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55)

Cited In (15)

• Exploiting symmetries in polyhedral computations
• On skeletons, diameters and volumes of metric polyhedra
• Non-projectability of polytope skeleta
• Title not available (Why is that?)
• On potential theoretic skeletons of polyhedra
• Classification of eight-dimensional perfect forms
• Hierarchic Euclidean Skeletons in Cubical Complexes
• The multi-layered network design problem
• Title not available (Why is that?)
• Some properties of the skeleton of the pyramidal tours polytope
• Integer Programming and Combinatorial Optimization
• On the face lattice of the metric polytope
• Multiperiod network design with incremental routing
• Statistical properties of the single linkage hierarchical clustering estimator
• A counterexample to the dominating set conjecture

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