Sciweavers

    ANOR
    2011
    131views more  ANOR 2011»
    A branch-and-bound algorithm for hard multiple knapsack problems
    14 years 5 months ago
    A branch-and-bound algorithm for hard multiple knapsack problems
    Download  metahack.org
    Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
    Alex S. Fukunaga
    claim paper
    Read More »
    82
    Voted
    CPAIOR
    2008
    Springer
    107views Operations Research» more  CPAIOR 2008»
    Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
    15 years 13 hour ago
    Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
    Download  metahack.org
    Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
    Alex S. Fukunaga
    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-2025, USA.