Cette recherche s'applique uniquement aux ressources en bibliothèque.
144 résultats
Trier par:
Ajouter à la liste:
Étendre à toutes les références (sans texte intégral)
    • Article
    Sélectionner

    A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs

    He, Qie, Ahmed, Shabbir, Nemhauser, George L.
    SIAM Journal on Optimization, 2011, Vol.21(3), pp.617-632 [Revue évaluée par les pairs]
    SIAM Journals (Society for Industrial and Applied Mathematics), Copyright �� by the Society of Industrial and Applied Mathematics, Philadelphia, PA
    Disponible
    Plus…
    Titre: A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs
    Auteur: He, Qie; Ahmed, Shabbir; Nemhauser, George L.
    Sujet: 90c11 ; 90c57 ; Mixed Integer Programs ; Split Cuts ; Triangle Cuts ; Probabilistic Comparison
    Description: We provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cutoff. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a type 1 triangle cut is better than a split cut.
    Fait partie de: SIAM Journal on Optimization, 2011, Vol.21(3), pp.617-632
    Identifiant: 1052-6234 (ISSN); 1095-7189 (E-ISSN); 10.1137/100797254 (DOI)

    • Livre
    Sélectionner

    Optimization

    Nemhauser, George L
    Amsterdam ; New York [etc.] : North-Holland
    1989
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Optimization / ed. by G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd
    Auteur: Nemhauser, George L
    Editeur: Amsterdam ; New York [etc.] : North-Holland
    Date: 1989
    Collation: XIV, 709 p. : ill. ; 25 cm
    Collection: Handbooks in operations research and management science ; vol. 1
    Documents dans cette collection: Handbooks in operations research and management science
    Sujet RERO: optimisation
    Sujet RERO - forme: [Études diverses]
    Classification: FSES C70
    DIUF 3.5.1
    Identifiant: 0444872841 (ISBN)
    No RERO: 1177173
    Permalien:
    http://data.rero.ch/01-1177173/html?view=FR_V1

    • Plusieurs versions

    A hybrid primal heuristic for finding feasible solutions to mixed integer programs

    Andrade, Carlos E, Ahmed, Shabbir, Nemhauser, George L, Shao, Yufen
    European Journal of Operational Research, 16 November 2017, Vol.263(1), pp.62-71 [Revue évaluée par les pairs]

    • Plusieurs versions

    MIRPLib – A library of maritime inventory routing problem instances: Survey, core model, and benchmark results

    Papageorgiou, Dimitri J, Nemhauser, George L, Sokol, Joel, Cheon, Myun-Seok, Keha, Ahmet B
    European Journal of Operational Research, 01 June 2014, Vol.235(2), pp.350-366 [Revue évaluée par les pairs]
    ScienceDirect Journals (Elsevier)
    • Livre
    Sélectionner

    Integer programming

    Garfinkel, Robert S
    Nemhauser, George L
    New York [etc.] : J. Wiley
    [1972]
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Integer programming / Robert S. Garfinkel, George L. Nemhauser
    Auteur: Garfinkel, Robert S
    Contributeur: Nemhauser, George L
    Editeur: New York [etc.] : J. Wiley
    Date: [1972]
    Collation: XIV, 427 p. : ill. ; 24 cm
    Collection: Series in decision and control
    Documents dans cette collection: Series in Decision and Control
    Sujet RERO: Recherche opérationnelle - Programmation en nombres entiers
    Note: Bibliogr.: p. 392-414. Index
    Classification: ams 90
    DIUF 3.5.3
    Identifiant: 0471291951 (ISBN)
    No RERO: 0028749
    Permalien:
    http://data.rero.ch/01-0028749/html?view=FR_V1

    • Livre
    Sélectionner

    Integer and combinatorial optimization

    Nemhauser, George L
    Wolsey, Laurence A
    New York ; Chichester [etc.] : J. Wiley
    [1988]
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Integer and combinatorial optimization / George L. Nemhauser, Laurence A. Wolsey
    Auteur: Nemhauser, George L
    Contributeur: Wolsey, Laurence A
    Editeur: New York ; Chichester [etc.] : J. Wiley
    Date: [1988]
    Collation: XIV, 763 p. : ill. ; 26 cm
    Collection: Wiley-interscience series in discrete mathematics
    Documents dans cette collection: Wiley-interscience series in discrete mathematics
    Sujet RERO: complexité - optimisation - Programmation linéaire
    Note: A Wiley-Interscience publication
    Classification: ams 65
    DIUF 3.5.3
    Identifiant: 047182819X (ISBN); http://catalogue.bnf.fr/ark:/12148/cb37362691c (URN)
    No RERO: 1033933
    Permalien:
    http://data.rero.ch/01-1033933/html?view=FR_V1

    • Article
    Sélectionner

    An Abstract Model for Branching and its Application to Mixed Integer Programming

    Bodic, Pierre Le, Nemhauser, George L.
    Cornell University
    Disponible
    Plus…
    Titre: An Abstract Model for Branching and its Application to Mixed Integer Programming
    Auteur: Bodic, Pierre Le; Nemhauser, George L.
    Sujet: Mathematics - Optimization And Control ; Computer Science - Data Structures And Algorithms ; 90c11, 90c60, 68q25
    Description: The selection of branching variables is a key component of branch-and-bound algorithms for solving Mixed-Integer Programming (MIP) problems since the quality of the selection procedure is likely to have a significant effect on the size of the enumeration tree. State-of-the-art procedures base the selection of variables on their "LP gains", which is the dual bound improvement obtained after branching on a variable. There are various ways of selecting variables depending on their LP gains. However, all methods are evaluated empirically. In this paper we present a theoretical model for the selection of branching variables. It is based upon an abstraction of MIPs to a simpler setting in which it is possible to analytically evaluate the dual bound improvement of choosing a given variable. We then discuss how the analytical results can be used to choose branching variables for MIPs, and we give experimental results that demonstrate the effectiveness of the method on MIPLIB 2010 "tree" instances where we achieve a 5% geometric average time and node improvement over the default rule of SCIP, a state-of-the-art MIP solver.
    Identifiant: 1511.01818 (ARXIV ID)

    • Plusieurs versions

    An integer programming approach for linear programs with probabilistic constraints

    Luedtke, James, Ahmed, Shabbir, Nemhauser, George
    Mathematical Programming, 2010, Vol.122(2), pp.247-272 [Revue évaluée par les pairs]

    • Plusieurs versions

    Comments on: On learning and branching: a survey

    Dilkina, Bistra, Khalil, Elias, Nemhauser, George
    TOP, 2017, Vol.25(2), pp.242-246 [Revue évaluée par les pairs]

    • Plusieurs versions

    Minimum concave cost flow over a grid network

    He, Qie, Ahmed, Shabbir, Nemhauser, George
    Mathematical Programming, 2015, Vol.150(1), pp.79-98 [Revue évaluée par les pairs]