Sciweavers

    SIGECOM
    2000
    ACM
    123views ECommerce» more  SIGECOM 2000»

    Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics

    13 years 9 months ago
    Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
    Download  www.ricagonen.com
    Rica Gonen, Daniel J. Lehmann
    claim paper
    Related Content
    Added 01 Aug 2010
    Updated 01 Aug 2010
    Type Conference
    Year 2000
    Where SIGECOM
    Authors Rica Gonen, Daniel J. Lehmann
    Comments (0)
    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.