Polarity and the complexity of the shooting experiment
type: Item
instance of: scholarly article
title: Polarity and the complexity of the shooting experiment
zbMATH Open document ID: 1190.90102
author: Brady Hunsaker
author: Ellis L. Johnson
author: Craig A. Tovey
published in: Discrete Optimization
publication date: 2008-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5358806
zbMATH Keywords: polarity
zbMATH Keywords: shooting experiment
zbMATH Keywords: polyhedral facet
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.12.001
OpenAlex ID: W1980499534
cites work: A note on the traveling salesman problem
cites work: Optimal attack and reinforcement of a network
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: On the Complexity of Computing the Volume of a Polyhedron
cites work: Matching, Euler tours and the Chinese postman
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Corner polyhedra and their connection with cutting planes
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: Q3137912
cites work: Q5519709
cites work: Q4017559
cites work: Analysis of a random cut test instance generator for the TSP
cites work: Some theoretical implications of local optimization
cites work: Q3818127
DOI: 10.1016/J.DISOPT.2006.12.001
description: scientific article; zbMATH DE number 5358806