Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Math Program Ser A

Search In Journal Title:

Abbravation: Mathematical Programming

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1016/j.aorn.2010.01.019

Search In DOI:

ISSN

1436-4646

Search In ISSN:
Search In Title Of Papers:

A model of the coNPcomplete nonHamilton tour dec

Authors: SJ Gismondi ER Swart
Publish Date: 2004/04/28
Volume: 100, Issue: 3, Pages: 471-483
PDF Link

Abstract

A truncated permutation matrix polytope is defined as the convex hull of a proper subset of npermutations represented as 0/1 matrices We present a linear system that models the coNPcomplete nonHamilton tour decision problem based upon constructing the convex hull of a set of truncated permutation matrix polytopes Define polytope Pn−1 as the convex hull of all n1 by n1 permutation matrices Each extreme point of Pn−1 is placed in correspondence a bijection with each Hamilton tour of a complete directed graph on n vertices Given any n vertex graph G n a polynomial sized linear system Fn is constructed for which the image of its solution set under an orthogonal projection is the convex hull of the complete set of extrema of a subset of truncated permutation matrix polytopes where each extreme point is in correspondence with each Hamilton tour not in G n The nonHamilton tour decision problem is modeled by Fn such that G n is nonHamiltonian if and only if under an orthogonal projection the image of the solution set of Fn is P n −1 The decision problem ‘Is the projection of the solution set of Fn=P n −1’ is therefore coNPcomplete and this particular model of the nonHamilton tour problem appears to be new


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. Submodular maximization meets streaming: matchings, matroids, and more
  2. Some computationally relevant group theoretic structures of fixed charge problems
  3. Applications of convex analysis within mathematics
  4. Large-scale semidefinite programs in electronic structure calculation
  5. A distributionally robust perspective on uncertainty quantification and chance constrained programming
  6. The factorization approach to large-scale linear programming
  7. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
  8. A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
  9. Breakpoint searching algorithms for the continuous quadratic knapsack problem
  10. Sandwich games
  11. Approximations of Nash equilibria
  12. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
  13. A robust and efficient method for solving point distance problems by homotopy
  14. A nonmonotone GRASP
  15. Extreme point inequalities and geometry of the rank sparsity ball
  16. Primal-dual interior-point methods for PDE-constrained optimization
  17. A new branch-and-cut algorithm for the capacitated vehicle routing problem
  18. Single item lot-sizing with non-decreasing capacities
  19. Structural and algorithmic properties for parametric minimum cuts
  20. Simple integer recourse models: convexity and convex approximations
  21. Iteration complexity analysis of block coordinate descent methods
  22. Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
  23. Accelerating the cubic regularization of Newton’s method on convex problems
  24. Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
  25. On the number of solutions to the linear comple-mentarity problem
  26. Time-consistent approximations of risk-averse multistage stochastic optimization problems
  27. PEBBL: an object-oriented framework for scalable parallel branch and bound
  28. PEBBL: an object-oriented framework for scalable parallel branch and bound
  29. The capacitated max k -cut problem
  30. Critical extreme points of the 2-edge connected spanning subgraph polytope
  31. Nash equilibria in the two-player kidney exchange game
  32. On some properties and an application of the logarithmic barrier method
  33. Complementarity systems in optimization
  34. On the exact separation of mixed integer knapsack cuts
  35. Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems

Search Result: