Identification of unidentified equality constraints for integer programming problems

DOI10.1016/J.EJOR.2016.12.040MaRDI QIDQ1753456zbMATH OpenOpenAlexFDO

Authors 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 programmingtraveling salesman problemextended formulationsconvex hull problemcombinatorial optimisation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Aggregation of constraints in integer programming
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• A new reduction method in integer programming
• A New Formulation for the Travelling Salesman Problem

Cites work

• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A new heuristic for detecting non-Hamiltonicity in cubic graphs
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An efficient algorithm for sparse null space basis problem using ABS methods
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Combinatorial optimization. Theory and algorithms
• Contributions to the Theory of Games (AM-24), Volume I
• Hamiltonian cycle curves in the space of discounted occupational measures
• How good are convex hull algorithms?
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
• On transition matrices of Markov chains corresponding to Hamiltonian cycles
• Projection, lifting and extended formulation integer and combinatorial optimization
• Reverse search for enumeration
• Strong formulations for mixed integer programming: A survey
• TSPLIB—A Traveling Salesman Problem Library
• The time dependent traveling salesman problem: polyhedra and algorithm
• polymake: a framework for analyzing convex polytopes

Cited in

(1)

• Equality detection for linear arithmetic constraints

Describes a project that uses

Uses Software

• PORTA
• TSPLIB
• polymake

This page was built for publication: Identification of unidentified equality constraints for integer programming problems

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