Discrete extremal problems
From MaRDI portal
Cites work
- A Class Of Abelian Groups
- A comparison of polynomial time reducibilities
- A Fast Monte-Carlo Test for Primality
- A greedy algorithm for solving a certain class of linear programmes
- A man-machine approach toward solving the traveling salesman problem
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time O(n^2 \log ^2 n)
- A nonlinear lower bound on linear search tree programs for solving knapsack-problems
- A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem
- A note on the total unimodularity of matrices
- Almost integral polyhedra related to certain combinatorial optimization problems
- An Algorithm for Solving a Resource Allocation Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Anti-blocking polyhedra
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for combinatorial problems
- Balanced matrices
- Blocking and anti-blocking pairs of polyhedra
- Bottleneck extrema
- Bottleneck linear programming
- Characterization of Totally Unimodular Matrices
- Combinatorial Problems: Reductibility and Approximation
- Convex polyhedra of doubly stochastic matrices III. Affine and combinatorial properties of
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Convex polyhedra of doubly stochastic matrices. IV
- Determining the Stability Number of a Graph
- Discrete Programming by the Filter Method
- Edmonds polytopes and a hierarchy of combinatorial problems
- Edmonds polytopes and weakly hamiltonian graphs
- Erratum: A Fast Monte-Carlo Test for Primality
- Every Prime Has a Succinct Certificate
- Extensions of Mappings into n-Cubes
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3121294 (Why is no real title available?)
- scientific article; zbMATH DE number 3121295 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3695387 (Why is no real title available?)
- scientific article; zbMATH DE number 3726086 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3488914 (Why is no real title available?)
- scientific article; zbMATH DE number 3490714 (Why is no real title available?)
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3510069 (Why is no real title available?)
- scientific article; zbMATH DE number 3551892 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3564333 (Why is no real title available?)
- scientific article; zbMATH DE number 3566162 (Why is no real title available?)
- scientific article; zbMATH DE number 3568040 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3584931 (Why is no real title available?)
- scientific article; zbMATH DE number 3593565 (Why is no real title available?)
- scientific article; zbMATH DE number 3614177 (Why is no real title available?)
- scientific article; zbMATH DE number 3619917 (Why is no real title available?)
- scientific article; zbMATH DE number 3622929 (Why is no real title available?)
- scientific article; zbMATH DE number 3639145 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3257409 (Why is no real title available?)
- scientific article; zbMATH DE number 3324347 (Why is no real title available?)
- scientific article; zbMATH DE number 3333883 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- scientific article; zbMATH DE number 3371825 (Why is no real title available?)
- scientific article; zbMATH DE number 3371831 (Why is no real title available?)
- scientific article; zbMATH DE number 3393931 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Integral Extreme Points
- Matroid intersection algorithms
- Matroids and the greedy algorithm
- Maximum matching and a polyhedron with 0,1-vertices
- Modules unimodulaires
- Neighbor relations on the convex of cyclic permutations
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
- Normal hypergraphs and the perfect graph conjecture
- Note on Independence Functions
- On certain polytopes associated with graphs
- On Finding and Updating Spanning Trees and Shortest Paths
- On Isomorphisms and Density of NP and Other Complete Sets
- On linear systems with integral valued solutions
- On recognizing graph properties from adjacency matrices
- On the Assignment Polytope
- On the Computational Complexity of Combinatorial Problems
- On the facial structure of set packing polyhedra
- On the Structure of Polynomial Time Reducibility
- On the truncated assignment polytope
- Optimal two- and three-stage production schedules with set-up time included
- P-Complete Approximation Problems
- Partial linear characterizations of the asymmetric travelling salesman polytope
- Perfect zero–one matrices
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Properties of vertex packing and independence system polyhedra
- Proving simultaneous positivity of linear forms
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Riemann's hypothesis and tests for primality
- Set Partitioning: A survey
- Some simplified NP-complete graph problems
- The Complexity of Near-Optimal Graph Coloring
- The Strong Perfect Graph Conjecture for Planar Graphs
- The travelling salesman problem and a class of polyhedra of diameter two
- Tight bounds for christofides' traveling salesman heuristic
- Total Unimodularity of Matrices
- Vertex packings: Structural properties and algorithms
- Zur mathematischen theorie der optimalen standardisierung
This page was built for publication: Discrete extremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152306)
