Identification of unidentified equality constraints for integer programming problems
From MaRDI portal
Publication:1753456
DOI10.1016/j.ejor.2016.12.040zbMath1403.90520OpenAlexW2565484893MaRDI QIDQ1753456
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
integer programmingtraveling salesman problemextended formulationsconvex hull problemcombinatorial optimisation problem
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On transition matrices of Markov chains corresponding to Hamiltonian cycles
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- Projection, lifting and extended formulation integer and combinatorial optimization
- Strong formulations for mixed integer programming: A survey
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- How good are convex hull algorithms?
- Reverse search for enumeration
- An efficient algorithm for sparse null space basis problem using ABS methods
- The time dependent traveling salesman problem: polyhedra and algorithm
- Hamiltonian cycle curves in the space of discounted occupational measures
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- Integer Programming
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- TSPLIB—A Traveling Salesman Problem Library
- Contributions to the Theory of Games (AM-24), Volume I
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Combinatorial optimization. Theory and algorithms
This page was built for publication: Identification of unidentified equality constraints for integer programming problems
