On the monotonization of polyhedra

DOI10.1016/S0025-5610(96)00073-1zbMath0890.90153OpenAlexW4248474833MaRDI QIDQ1373726

Egon Balas, Matteo Fischetti

Publication date: 25 November 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0025-5610(96)00073-1

zbMATH Keywords

traveling salesmandominantpolyhedral combinatoricsfacial structuregeneralized monotonizationsubmissive

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items (10)

Tight Approximations of Dynamic Risk Measures ⋮ Solving the Distance-Based Critical Node Problem ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs ⋮ Steiner trees and polyhedra ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ On the cycle polytope of a directed graph and its relaxations ⋮ How to recycle your facets ⋮ On the dimension of projected polyhedra

This page was built for publication: On the monotonization of polyhedra