Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:air.uniud.it:11390/1066984

Local search inequalities

Authors
Publication date
1 January 2015
Publisher
Doi

    Abstract

    We describe a general method for deriving new inequalities for integer programming formulations of combinatorial optimization problems. The inequalities, motivated by local search algorithms, are valid for all optimal solutions but not necessarily for all feasible solutions. These local search inequalities can help in either pruning the search tree at some nodes or in improving the bound of the LP relaxations

    Similar works

    Full text

    thumbnail-image

    Archivio istituzionale della ricerca - Università degli Studi di Udine

    redirect
    oaioai:air.uniud.it:11390/1066984
    Last time updated on 12/11/2016

    This paper was published in Archivio istituzionale della ricerca - Università degli Studi di Udine.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.