Sciweavers

    206 search results - page 2 / 42
    » A branch-and-bound algorithm for hard multiple knapsack prob...
    Sort
    View
    SSWMC
    2004
    156views Security Privacy» more  SSWMC 2004»
    On the complexity and hardness of the steganography embedding problem
    13 years 6 months ago
    On the complexity and hardness of the steganography embedding problem
    Download  www.ece.stevens-tech.edu
    We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
    Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
    claim paper
    Read More »
    ANOR
    2010
    123views more  ANOR 2010»
    Nature inspired genetic algorithms for hard packing problems
    13 years 5 months ago
    Nature inspired genetic algorithms for hard packing problems
    Download  www.cs.bham.ac.uk
    This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
    Philipp Rohlfshagen, John A. Bullinaria
    claim paper
    Read More »
    CPAIOR
    2008
    Springer
    107views Operations Research» more  CPAIOR 2008»
    Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
    13 years 6 months 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 »
    MP
    2002
    143views more  MP 2002»
    Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
    13 years 4 months ago
    Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
    Download  www.math.tu-dresden.de
    The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
    François Vanderbeck
    claim paper
    Read More »
    GECCO
    2007
    Springer
    164views Optimization» more  GECCO 2007»
    ExGA II: an improved exonic genetic algorithm for the multiple knapsack problem
    13 years 11 months ago
    ExGA II: an improved exonic genetic algorithm for the multiple knapsack problem
    Download  www.cs.bham.ac.uk
    Philipp Rohlfshagen, John A. Bullinaria
    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.