Sciweavers

    DISOPT
    2011
    201views Education» more  DISOPT 2011»
    The Wiener maximum quadratic assignment problem
    12 years 10 months ago
    The Wiener maximum quadratic assignment problem
    Download  www.opt.math.tu-graz.ac.at
    We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
    Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
    claim paper
    Read More »
    DISOPT
    2011
    176views Education» more  DISOPT 2011»
    Valid inequalities and branch-and-cut for the clique pricing problem
    12 years 10 months ago
    Valid inequalities and branch-and-cut for the clique pricing problem
    Download  www.optimization-online.org
    Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
    Géraldine Heilporn, Martine Labbé, P...
    claim paper
    Read More »
    DISOPT
    2011
    175views Education» more  DISOPT 2011»
    Strengthening lattice-free cuts using non-negativity
    12 years 10 months ago
    Strengthening lattice-free cuts using non-negativity
    Download  www.optimization-online.org
    In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
    Ricardo Fukasawa, Oktay Günlük
    claim paper
    Read More »
    DISOPT
    2011
    177views Education» more  DISOPT 2011»
    Lower bounds on kernelization
    13 years 1 months ago
    Lower bounds on kernelization
    Download  www.imsc.res.in
    Neeldhara Misra, Venkatesh Raman, Saket Saurabh
    claim paper
    Read More »
    DISOPT
    2011
    210views Education» more  DISOPT 2011»
    The parameterized complexity of k-flip local search for SAT and MAX SAT
    13 years 1 months ago
    The parameterized complexity of k-flip local search for SAT and MAX SAT
    Download  www.kr.tuwien.ac.at
    SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
    Stefan Szeider
    claim paper
    Read More »
    DISOPT
    2011
    240views Education» more  DISOPT 2011»
    On the directed Full Degree Spanning Tree problem
    13 years 1 months ago
    On the directed Full Degree Spanning Tree problem
    Download  www-lti.informatik.rwth-aachen.de
    We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
    Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
    claim paper
    Read More »
    DISOPT
    2011
    213views Education» more  DISOPT 2011»
    On the algorithmic effectiveness of digraph decompositions and complexity measures
    13 years 1 months ago
    On the algorithmic effectiveness of digraph decompositions and complexity measures
    Download  web.cs.gc.cuny.edu
    Michael Lampis, Georgia Kaouri, Valia Mitsou
    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.