An appraisal of computational complexity for operations researchers
From MaRDI portal
(Redirected from Publication:1173532)
Cites work
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- A simple heuristic approach to simplex efficiency
- An Algorithm for Large Zero-One Knapsack Problems
- Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
- Analytical Evaluation of Hierarchical Planning Systems
- Complete Convergence of Short Paths and Karp's Algorithm for the TSP
- Computational Complexity of Discrete Optimization Problems
- Computing the Minimum Fill-In is NP-Complete
- Decomposition of regular matroids
- Every Prime Has a Succinct Certificate
- Feature Article—The Ellipsoid Method: A Survey
- Hierarchical vehicle routing problems
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3648431 (Why is no real title available?)
- scientific article; zbMATH DE number 3708085 (Why is no real title available?)
- scientific article; zbMATH DE number 3708086 (Why is no real title available?)
- scientific article; zbMATH DE number 3723875 (Why is no real title available?)
- scientific article; zbMATH DE number 3747230 (Why is no real title available?)
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 3750968 (Why is no real title available?)
- scientific article; zbMATH DE number 3754672 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Khachiyan’s algorithm for linear programming
- Linear programming is log-space hard for P
- Matroid matching and some applications
- On distinguishing prime numbers from composite numbers
- On Isomorphisms and Density of NP and Other Complete Sets
- On the complexity of integer programming
- On the Computational Complexity of Combinatorial Problems
- On the Structure of Polynomial Time Reducibility
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Polynomial algorithms for a class of linear programs
- Probabilistic algorithm for testing primality
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Probabilistic Analysis of the Planar k-Median Problem
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Steinhaus's geometric location problem for random samples in the plane
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
- The Complexity of the Partial Order Dimension Problem
- The ellipsoid method and its consequences in combinatorial optimization
- The NP-completeness column: An ongoing guide
- The NP-Completeness of Edge-Coloring
This page was built for publication: An appraisal of computational complexity for operations researchers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173532)
