ویراساینس.
سند علمی

A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem

Ian Shields, Carla D. Savage

چکیده

The notorious middle two levels problem is to find a Hamilton cycle in the middle two levels, M2k+1, of the Hasse diagram of B2k+1 (the partially ordered set of subsets of a 2k + 1-element set ordered by inclusion). Previously, the best known result, due to Moews and Reid [11] in 1990, was that M2k+1 is Hamiltonian for all positive k through k = 11. We show that if a Hamilton path between two distinguished vertices exists in a reduced graph then a Hamilton cycle can be constructed in the middle two levels. We describe a heuristic for finding Hamilton paths and apply it to the reduced graph to extend the previous best known results. This also improves the best lower bound on the length of a longest cycle in M2k+1 for any k.

اسناد مشابه

  • A Hamilton Path Heuristic with Applicationsto the Middle Two Levels

    سند علمی۱۹۹۹Ian Shields, Carla D. Savage

    The notorious middle two levels problem is to nd a Hamilton cycle in the middle two levels, M 2k+1 , of the Hasse diagram of B 2k+1 (the partially ordered set of subsets of a 2k + 1-element set ordered by inclusion). Previously, the best known result, due to Moews and Reid 11] in

  • Mathematical Models and Lagrangian Heuristics for a Two-level Lot-sizing Problem with Bounded Inventory

    سند علمی۲۰۱۰N. BRAHIMI, N. ABSI, S. DAUZERE-PERES, S. KEDAD-SIDHOUM

    ABSTRACT: We consider a two-level lot-sizing problem where the first level consists of N end products competing for a single type of raw material (second level), which is supposed to be critical. In particular, the storage capacity of raw materials is limited and must be carefull

  • Neighborhood based heuristics for a Two-level Hierarchical Location Problem with modular node capacities

    سند علمی۲۰۱۱Bernardetta Addis, Giuliana Carello, Alberto Ceselli

    In many telecommunication network architectures a given set of client nodes must be served by different kinds of facility, which provide different services and have different capabilities. Such facilities must be located and dimensioned in the design phase. We tackle a particular

  • A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction

    سند علمی۲۰۰۴Graph DrawingMichael Forster

    The one-sided two-level crossing reduction problem is an important problem in hierarchical graph drawing. Because of its NPhardness there are many heuristics, such as the well-known barycenter and median heuristics. We consider the constrained one-sided two-level crossing reducti

  • Long Cycles in the Middle Two Levels of the Boolean Lattice

    سند علمی۱۹۹۷Carla D Savage

    An intriguing open question is whether the graph formed by the middle two levels of the Boolean lattice of subsets of a k element set has a Hamilton path for all k We consider nding a lower bound on the length of the longest cycle in this graph A result of Babai for vertex transi

  • A Heuristic Method of Two-Level Logic Synthesis

    سند علمی۲۰۰۱Jan Petr Fišer

    An original method of logic function minimization is presented. Its implementation denoted as BOOM minimizer is described an evaluated. The method is applicable to the problems of logic design, artificial intelligence, software engineering and graph theory, etc. The innovative fe