On facet-inducing inequalities for combinatorial polytopes

DOI10.1134/S1990478917040147MaRDI QIDQ5374012zbMATH OpenOpenAlexFDO

Authors R. Yu. Simanchev

Publication date 6 April 2018

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1990478917040147

zbMATH Keywords

polytopefacetsupporting inequality\(M\)-graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• On the facets of combinatorial polytopes
• Facet generating techniques
• On the polytope faces of the graph approximation problem
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Recognizing facet defining inequalities

Cites work

• scientific article; zbMATH DE number 3828714 (Why is no real title available?)
• scientific article; zbMATH DE number 1205994 (Why is no real title available?)
• scientific article; zbMATH DE number 1110374 (Why is no real title available?)
• (1,k)-configurations and facets for packing problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
• Approximation algorithms for graph approximation problems
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Combinatorial optimization. Theory and applications.
• Computational complexity of the graph approximation problem
• Facet identification for the symmetric traveling salesman polytope
• Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
• NP-hard problems in hierarchical-tree clustering
• On the polytope faces of the graph approximation problem
• Solution of large-scale symmetric travelling salesman problems
• Solving Large-Scale Zero-One Linear Programming Problems
• The generalized assignment problem: Valid inequalities and facets
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

Cited in

(7)

• A necessary condition for facetness of comb inequalities for a polytope of connected 2k-factors
• On the facets of combinatorial polytopes
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Facet generating techniques
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
• Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
• Facets of the weak order polytope derived from the induced partition projection

This page was built for publication: On facet-inducing inequalities for combinatorial polytopes

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