Sciweavers

    COR
    2008
    77views more  COR 2008»
    A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
    13 years 10 months ago
    A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
    Download  eprints.soton.ac.uk
    Julia A. Bennell, Xiang Song
    claim paper
    Read More »
    COR
    2008
    62views more  COR 2008»
    Meta-heuristics for stable scheduling on a single machine
    13 years 10 months ago
    Meta-heuristics for stable scheduling on a single machine
    Download  www.econ.kuleuven.be
    Francisco Ballestín, Roel Leus
    claim paper
    Read More »
    COR
    2008
    111views more  COR 2008»
    An optimization algorithm for the inventory routing problem with continuous moves
    13 years 10 months ago
    An optimization algorithm for the inventory routing problem with continuous moves
    Download  www2.isye.gatech.edu
    The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
    Martin W. P. Savelsbergh, Jin-Hwa Song
    claim paper
    Read More »
    COR
    2008
    105views more  COR 2008»
    Minimizing the object dimensions in circle and sphere packing problems
    13 years 10 months ago
    Minimizing the object dimensions in circle and sphere packing problems
    Download  www.ime.usp.br
    Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
    Ernesto G. Birgin, F. N. C. Sobral
    claim paper
    Read More »
    COR
    2008
    54views more  COR 2008»
    Reactive GRASP for the strip-packing problem
    13 years 10 months ago
    Reactive GRASP for the strip-packing problem
    Download  www.uv.es
    Ramón Alvarez-Valdés, Francisco Parr...
    claim paper
    Read More »
    COR
    2008
    88views more  COR 2008»
    Solving the swath segment selection problem through Lagrangean relaxation
    13 years 10 months ago
    Solving the swath segment selection problem through Lagrangean relaxation
    Download  www.crema.unimi.it
    The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
    Roberto Cordone, Federico Gandellini, Giovanni Rig...
    claim paper
    Read More »
    COR
    2008
    99views more  COR 2008»
    Repairing MIP infeasibility through local branching
    13 years 10 months ago
    Repairing MIP infeasibility through local branching
    Download  www.dei.unipd.it
    Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
    Matteo Fischetti, Andrea Lodi
    claim paper
    Read More »
    COR
    2008
    92views more  COR 2008»
    Lagrangean relaxation with clusters for point-feature cartographic label placement problems
    13 years 10 months ago
    Lagrangean relaxation with clusters for point-feature cartographic label placement problems
    Download  www.lac.inpe.br
    This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
    Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
    claim paper
    Read More »
    COR
    2008
    96views more  COR 2008»
    Discrete models for competitive location with foresight
    13 years 10 months ago
    Discrete models for competitive location with foresight
    Download  www.vub.ac.be
    We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective ...
    Frank Plastria, Lieselot Vanhaverbeke
    claim paper
    Read More »
    COR
    2008
    88views more  COR 2008»
    Lagrangian bounds for just-in-time job-shop scheduling
    13 years 10 months ago
    Lagrangian bounds for just-in-time job-shop scheduling
    Download  www.lix.polytechnique.fr
    Philippe Baptiste, Marta Flamini, Francis Sourd
    claim paper
    Read More »
    « first‹ previous12345678next ›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.