Sciweavers

    2 search results - page 1 / 1
    » Optimal solutions for multi-unit combinatorial auctions: bra...
    Sort
    View
    SIGECOM
    2000
    ACM
    123views ECommerce» more  SIGECOM 2000»
    Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
    13 years 11 months ago
    Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
    Download  www.ricagonen.com
    Rica Gonen, Daniel J. Lehmann
    claim paper
    Read More »
    JSAT
    2010
    132views more  JSAT 2010»
    The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
    13 years 2 months ago
    The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
    Download  jsat.ewi.tudelft.nl
    In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
    Federico Heras, David Bañeres
    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.