Sciweavers

    MP
    2002
    143views more  MP 2002»
    Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
    14 years 3 days 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 »
    EOR
    2007
    111views more  EOR 2007»
    A pegging approach to the precedence-constrained knapsack problem
    14 years 12 days ago
    A pegging approach to the precedence-constrained knapsack problem
    Download  www.nda.ac.jp
    The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
    Byungjun You, Takeo Yamada
    claim paper
    Read More »
    DAM
    2007
    100views more  DAM 2007»
    Partially ordered knapsack and applications to scheduling
    14 years 12 days ago
    Partially ordered knapsack and applications to scheduling
    Download  cgi.di.uoa.gr
    In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
    Stavros G. Kolliopoulos, George Steiner
    claim paper
    Read More »
    EOR
    2006
    73views more  EOR 2006»
    An exact algorithm for the knapsack sharing problem with common items
    14 years 13 days ago
    An exact algorithm for the knapsack sharing problem with common items
    Download  www.nda.ac.jp
    We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
    Masako Fujimoto, Takeo Yamada
    claim paper
    Read More »
    COR
    2006
    62views more  COR 2006»
    Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
    14 years 14 days ago
    Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
    Download  www.angelfire.com
    This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0
    Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad...
    claim paper
    Read More »
    PDPTA
    1996
    197views Distributed And Parallel Com...» more  PDPTA 1996»
    Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
    14 years 1 months ago
    Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
    Download  www.cs.kent.edu
    This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
    Darrell R. Ulm, Johnnie W. Baker
    claim paper
    Read More »
    WSC
    1998
    126views Modeling And Simulation» more  WSC 1998»
    Properties of Synthetic Optimization Problems
    14 years 1 months ago
    Properties of Synthetic Optimization Problems
    Download  www.informs-sim.org
    In this paper, we present an approach for measuring certain properties of synthetic optimization problems based on the assumed distribution of coefficient values. We show how to e...
    Charles H. Reilly
    claim paper
    Read More »
    SSWMC
    2004
    156views Security Privacy» more  SSWMC 2004»
    On the complexity and hardness of the steganography embedding problem
    14 years 1 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 »
    SODA
    2004
    ACM
    110views Algorithms» more  SODA 2004»
    Probabilistic analysis of knapsack core algorithms
    14 years 1 months ago
    Probabilistic analysis of knapsack core algorithms
    Download  www.cs.princeton.edu
    We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
    René Beier, Berthold Vöcking
    claim paper
    Read More »
    AAAI
    2004
    116views Intelligent Agents» more  AAAI 2004»
    The Practice of Approximated Consistency for Knapsack Constraints
    14 years 1 months ago
    The Practice of Approximated Consistency for Knapsack Constraints
    Download  www.cs.brown.edu
    Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
    Meinolf Sellmann
    claim paper
    Read More »
    12next ›last »
    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.