Sciweavers

    5331 search results - page 159 / 1067
    » Algebraic Methods for Optimization Problems
    Sort
    View
    ANOR
    2002
    67views more  ANOR 2002»
    An Improved Hybrid Model for the Generic Hoist Scheduling Problem
    14 years 10 months ago
    An Improved Hybrid Model for the Generic Hoist Scheduling Problem
    Download  www.ai.sri.com
    Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
    Daniel Riera, Neil Yorke-Smith
    claim paper
    Read More »
    TSMC
    2002
    142views more  TSMC 2002»
    Dynamics of local search heuristics for the traveling salesman problem
    14 years 9 months ago
    Dynamics of local search heuristics for the traveling salesman problem
    Download  www.umflint.edu
    This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
    Weiqi Li, Bahram Alidaee
    claim paper
    Read More »
    77
    Voted
    SDM
    2009
    SIAM
    219views Data Mining» more  SDM 2009»
    A Hybrid Data Mining Metaheuristic for the p-Median Problem.
    15 years 7 months ago
    A Hybrid Data Mining Metaheuristic for the p-Median Problem.
    Download  www.siam.org
    Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
    Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
    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 11 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 »
    EOR
    2008
    79views more  EOR 2008»
    Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
    14 years 10 months ago
    Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
    Download  www.lancs.ac.uk
    The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
    Konstantinos Kaparis, Adam N. Letchford
    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.