Sciweavers

    CPAIOR
    2007
    Springer
    136views Operations Research» more  CPAIOR 2007»
    The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
    13 years 10 months ago
    The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
    Download  dlev.net
    We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
    Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.