Sciweavers

    721 search results - page 27 / 145
    » On Generators of Random Quasigroup Problems
    Sort
    View
    ASIAMS
    2007
    IEEE
    136views Modeling and Simulation» more  ASIAMS 2007»
    Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
    14 years 2 months ago
    Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
    Download  www.softcomputing.net
    The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
    Crina Grosan, Ajith Abraham
    claim paper
    Read More »
    COR
    2006
    94views more  COR 2006»
    A comparison of two different formulations for arc routing problems on mixed graphs
    13 years 8 months ago
    A comparison of two different formulations for arc routing problems on mixed graphs
    Download  www.uv.es
    Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
    Angel Corberán, Enrique Mota, José M...
    claim paper
    Read More »
    COR
    2007
    112views more  COR 2007»
    The bi-objective covering tour problem
    13 years 8 months ago
    The bi-objective covering tour problem
    Download  www.lifl.fr
    The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
    Nicolas Jozefowiez, Frédéric Semet, ...
    claim paper
    Read More »
    IOR
    2006
    93views more  IOR 2006»
    A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
    13 years 8 months ago
    A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
    Download  www.crema.unimi.it
    The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
    Alberto Ceselli, Giovanni Righini
    claim paper
    Read More »
    IOR
    2006
    173views more  IOR 2006»
    A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
    13 years 8 months ago
    A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
    Download  www.iro.umontreal.ca
    In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
    Jean-François Cordeau
    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.