Polarity and the complexity of the shooting experiment
From MaRDI portal
(Redirected from Publication:951126)
Recommendations
Cites work
- scientific article; zbMATH DE number 429689 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 91756 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- A note on the traveling salesman problem
- Analysis of a random cut test instance generator for the TSP
- Blocking and anti-blocking pairs of polyhedra
- Corner polyhedra and their connection with cutting planes
- Matching, Euler tours and the Chinese postman
- On the Complexity of Computing the Volume of a Polyhedron
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Optimal attack and reinforcement of a network
- Solution of a Large-Scale Traveling-Salesman Problem
- Some theoretical implications of local optimization
Cited in
(3)
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)