Corpus ID: 8950784

Convex and linear models of NP-problems

@article{Gubin2007ConvexAL,
  title={Convex and linear models of NP-problems},
  author={S. Gubin},
  journal={ArXiv},
  year={2007},
  volume={abs/0711.0086}
}
  • S. Gubin
  • Published 2007
  • Computer Science, Mathematics
  • ArXiv
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope. Introduction Since the classical works of J. Edmonds [2, and others], linear modeling became a common technique in combinatorial optimization [8, 9, 13, 14, 15, 16, and others]. Often, the linear models are expressed with some constrains on the incidence vector. The major benefit of this approach is the symmetry of the resulting model: the resulting equations are an invariant under relabeling. The major… Expand

Topics from this paper

References

SHOWING 1-10 OF 27 REFERENCES
Maximum matching and a polyhedron with 0,1-vertices
TLDR
The emphasis in this paper is on relating the matching problem to the theory of continuous linear programming, and the algorithm described does not involve any "blind-alley programming" -which, essentially, amounts to testing a great many combinations. Expand
Expressing combinatorial optimization problems by linear programs
TLDR
It is shown that expressing the matching and the Traveling Salesman Problem by a symmetric linear program requires exponential size, and the minimum size needed by a LP to express a polytope to a combinatorial parameter is related. Expand
Interior-point polynomial algorithms in convex programming
TLDR
This book describes the first unified theory of polynomial-time interior-point methods, and describes several of the new algorithms described, e.g., the projective method, which have been implemented, tested on "real world" problems, and found to be extremely efficient in practice. Expand
On linear characterizations of combinatorial optimization problems
  • R. Karp, C. Papadimitriou
  • Mathematics, Computer Science
  • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
TLDR
The ellipsoid method for linear programming is applied to show that a combinatorial optimization problem is solvable in polynomial time if and only if it admits a small generator of violated inequalities. Expand
The traveling salesman problem and its variations
Preface. Contributing Authors.- 1. The Traveling Salesman Problem: Applications, Formulations and Variations.- 2. Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP.- 3. PolyhedralExpand
The Graph Isomorphism Problem: Its Structural Complexity
Introduction Preliminaries Decision Problems, Search Problems, and Counting Problems NP-Completeness The Classes P and NP Reducibility. Reducing the Construction Problem to the Decision ProblemExpand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is aExpand
Combinatorial optimization. Polyhedra and efficiency.
TLDR
This book shows the combinatorial optimization polyhedra and efficiency as your friend in spending the time in reading a book. Expand
Graphs, algorithms and optimization
TLDR
The primal-dual algorithm, which combines the dual of the shortest path problem and its dual Geometric interpretation, is presented. Expand
...
1
2
3
...