Polarity and the complexity of the shooting experiment

DOI10.1016/J.DISOPT.2006.12.001zbMATH Open1190.90102OpenAlexW1980499534MaRDI QIDQ951126FDOQ951126

Authors: Brady Hunsaker, Ellis L. Johnson, Craig A. Tovey 

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

Recommendations

• scientific article; zbMATH DE number 3943560
• On the stochastic complexity of the asymmetric traveling salesman problem
• A note on the traveling salesman problem
• The traveling salesman problem and its variations
• Publication:4731019

zbMATH Keywords

polaritypolyhedral facetshooting experiment

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Matching, Euler tours and the Chinese postman
• Solution of a Large-Scale Traveling-Salesman Problem
• Corner polyhedra and their connection with cutting planes
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• Blocking and anti-blocking pairs of polyhedra
• On the Complexity of Computing the Volume of a Polyhedron
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Title not available (Why is that?)
• Optimal attack and reinforcement of a network
• Title not available (Why is that?)
• A note on the traveling salesman problem
• Analysis of a random cut test instance generator for the TSP
• Title not available (Why is that?)
• Some theoretical implications of local optimization

Cited In (3)

• A concise characterization of strong knapsack facets
• Using two-dimensional projections for stronger separation and propagation of bilinear terms
• Easy and hard separation of sparse and dense odd-set constraints in matching

This page was built for publication: Polarity and the complexity of the shooting experiment

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