Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • On the complexity of four poly...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
On the complexity of four polyhedral set containment problems

On the complexity of four polyhedral set containment problems

Bibliographic Details
Main Authors: Freund, Robert Michael, Orlin, James B.
Format: Working Paper
Published: Cambridge, Mass. : Massachusetts Institute of Technology, Alfred P. Sloan School of Management 2009
Online Access:http://hdl.handle.net/1721.1/48641
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1721.1/48641

Similar Items

  • On Unique Determination of Polyhedral Sets
    by: Luca Rondi
    Published: (2023-11-01)
  • Zipper Unfoldings of Polyhedral Complexes
    by: Demaine, Erik D., et al.
    Published: (2011)
  • Polyhedral Oligomeric Silsesquioxane (POSS)-Containing Polymer Nanocomposites
    by: Biswajit Sarkar, et al.
    Published: (2012-12-01)
  • Sensitivity analysis for variational inequalities defined on polyhedral sets
    Published: (2004)
  • The Gomory-Chvátal closure : polyhedrality, complexity, and extensions
    by: Dunkel, Juliane
    Published: (2012)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs