On facet-inducing inequalities for combinatorial polytopes

DOI10.1134/S1990478917040147zbMath1399.90224OpenAlexW2768257653MaRDI QIDQ5374012

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) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Cites Work

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

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