Polarity and the complexity of the shooting experiment
From MaRDI portal
Publication:951126
DOI10.1016/j.disopt.2006.12.001zbMath1190.90102OpenAlexW1980499534MaRDI QIDQ951126
Brady Hunsaker, Craig A. Tovey, Ellis L. Johnson
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.12.001
Related Items (2)
A concise characterization of strong knapsack facets ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the traveling salesman problem
- Corner polyhedra and their connection with cutting planes
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Optimal attack and reinforcement of a network
- On the Complexity of Computing the Volume of a Polyhedron
- Some theoretical implications of local optimization
- Matching, Euler tours and the Chinese postman
- Solution of a Large-Scale Traveling-Salesman Problem
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Polarity and the complexity of the shooting experiment
