Sciweavers

    1304 search results - page 1 / 261
    » An Integrated Solver for Optimization Problems
    Sort
    View
    IOR
    2010
    79views more  IOR 2010»
    An Integrated Solver for Optimization Problems
    13 years 9 months ago
    An Integrated Solver for Optimization Problems
    Download  wpweb2.tepper.cmu.edu
    Tallys H. Yunes, Ionut D. Aron, John N. Hooker
    claim paper
    Read More »
    PROCEDIA
    2010
    173views more  PROCEDIA 2010»
    Combination of an adaptive multilevel SQP method and a space-time adaptive PDAE solver for optimal control problems
    13 years 9 months ago
    Combination of an adaptive multilevel SQP method and a space-time adaptive PDAE solver for optimal control problems
    Download  www.mathematik.tu-darmstadt.de
    We present an adaptive multilevel generalized SQP method to solve PDAE-constrained optimization problems. It explicitly allows the use of independent integration schemes such that...
    Debora Clever, Jens Lang, Stefan Ulbrich, J. Carst...
    claim paper
    Read More »
    MOC
    1998
    96views more  MOC 1998»
    Fast solvers of integral and pseudodifferential equations on closed curves
    13 years 10 months ago
    Fast solvers of integral and pseudodifferential equations on closed curves
    Download  www.ams.org
    On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
    Jukka Saranen, Gennadi Vainikko
    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
    14 years 19 days 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 »
    ANOR
    2011
    131views more  ANOR 2011»
    A branch-and-bound algorithm for hard multiple knapsack problems
    13 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 »
    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.