Identification of unidentified equality constraints for integer programming problems

DOI10.1016/j.ejor.2016.12.040zbMath1403.90520MaRDI QIDQ1753456

Asghar Moeini

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.040

zbMATH Keywords

integer programming; traveling salesman problem; extended formulations; convex hull problem; combinatorial optimisation problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Uses Software

• polymake
• TSPLIB
• PORTA