4
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Integer Programming and Combinatorial Optimization 

      Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references28

          • Record: found
          • Abstract: not found
          • Article: not found

          Outline of an algorithm for integer solutions to linear programs

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The intractability of resolution

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Edmonds polytopes and a hierarchy of combinatorial problems

                Bookmark

                Author and book information

                Book Chapter
                1999
                April 30 1999
                : 137-150
                10.1007/3-540-48777-8_11
                874eee14-167f-4623-af99-3182ac3fbd17
                History

                Comments

                Comment on this book

                Book chapters

                Similar content3,474

                Cited by3