Identification of unidentified equality constraints for integer programming problems
type: Item
instance of: scholarly article
title: Identification of unidentified equality constraints for integer programming problems
zbMATH Open document ID: 1403.90520
author: Asghar Moeini
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6875783
zbMATH Keywords: integer programming
zbMATH Keywords: convex hull problem
zbMATH Keywords: combinatorial optimisation problem
zbMATH Keywords: extended formulations
zbMATH Keywords: traveling salesman problem
describes a project that uses: polymake
describes a project that uses: TSPLIB
describes a project that uses: PORTA
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.040
OpenAlex ID: W2565484893
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: How good are convex hull algorithms?
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Reverse search for enumeration
cites work: On transition matrices of Markov chains corresponding to Hamiltonian cycles
cites work: Projection, lifting and extended formulation integer and combinatorial optimization
cites work: Integer Programming
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: A new heuristic for detecting non-Hamiltonicity in cubic graphs
cites work: Hamiltonian cycle curves in the space of discounted occupational measures
cites work: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
cites work: polymake: a framework for analyzing convex polytopes
cites work: Q4917542
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: An efficient algorithm for sparse null space basis problem using ABS methods
cites work: Combinatorial optimization. Theory and algorithms
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
cites work: Contributions to the Theory of Games (AM-24), Volume I
cites work: Strong formulations for mixed integer programming: A survey
DOI: 10.1016/J.EJOR.2016.12.040
description: scientific article; zbMATH DE number 6875783