On facet-inducing inequalities for combinatorial polytopes
From MaRDI portal
Publication:5374012
DOI10.1134/S1990478917040147zbMATH Open1399.90224OpenAlexW2768257653MaRDI QIDQ5374012FDOQ5374012
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
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The generalized assignment problem: Valid inequalities and facets
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Facet identification for the symmetric traveling salesman polytope
- Combinatorial optimization. Theory and applications.
- Approximation algorithms for graph approximation problems
- Solution of large-scale symmetric travelling salesman problems
- Computational complexity of the graph approximation problem
- NP-hard problems in hierarchical-tree clustering
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- (1,k)-configurations and facets for packing problems
- Title not available (Why is that?)
- An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
- Title not available (Why is that?)
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
- On the polytope faces of the graph approximation problem
Cited In (5)
- A necessary condition for facetness of comb inequalities for a polytope of connected \(2k\)-factors
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- 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)
