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

    Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds

    Wolsey, Laurence
    Mathematical Programming, 2017, Vol.161(1), pp.603-609 [Revue évaluée par les pairs]

    • Article
    Sélectionner

    Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004

    Liebling, Thomas M
    Naddef, Denis, Wolsey, Laurence A
    Mathematical Programming. - 2006/105/2-3/157-160
    Disponible
    Plus…
    Titre: Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004
    Auteur: Liebling, Thomas M
    Contributeur: Naddef, Denis; Wolsey, Laurence A
    Publication en relation: Mathematical Programming. - 2006/105/2-3/157-160
    Document hôte: Mathematical Programming
    Identifiant: 10.1007/s10107-005-0646-8 (DOI)

    • Livre
    Sélectionner

    Integer programming

    Wolsey, Laurence A
    New York [etc.] : J. Wiley
    [1998]
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Integer programming / Laurence A. Wolsey
    Auteur: Wolsey, Laurence A
    Editeur: New York [etc.] : J. Wiley
    Date: [1998]
    Collation: XVIII, 264 p. : ill. ; 25 cm
    Collection: Wiley-interscience series in discrete mathematics and optimization
    Documents dans cette collection: Wiley-interscience series in discrete mathematics
    Sujet RERO: Programmation en nombres entiers
    Classification: DIUF 3.5.3
    Identifiant: 0471283665 (ISBN); http://catalogue.bnf.fr/ark:/12148/cb390397381 (URN)
    No RERO: R003362844
    Permalien:
    http://data.rero.ch/01-R003362844/html?view=FR_V1

    • Plusieurs versions

    Optimizing production and transportation in a commit-to-delivery business mode

    Melo, Rafael A, Wolsey, Laurence A
    European Journal of Operational Research, 2010, Vol.203(3), pp.614-618 [Revue évaluée par les pairs]

    • 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

    • Livre
    Sélectionner

    Production planning by mixed integer programming

    Pochet, Yves
    Wolsey, Laurence A
    New York : Springer
    2006
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Production planning by mixed integer programming / Yves Pochet, Laurence A. Wolsey
    Auteur: Pochet, Yves
    Contributeur: Wolsey, Laurence A
    Editeur: New York : Springer
    Date: 2006
    Collation: 499 p. : ill.
    Collection: Springer series in operations research and financial engineering
    Documents dans cette collection: Springer series in operations research and financial engineering
    Sujet RERO: production - planification - Programmation en nombres entiers - modèle mathématique - modélisation - optimisation
    Classification: DIUF 2.2.6
    Identifiant: 0387299599 (ISBN)
    No RERO: R004148130
    Permalien:
    http://data.rero.ch/01-R004148130/html?view=FR_V1

    • Article
    Sélectionner

    Mixing Sets Linked by Bidirected Paths

    Di Summa, Marco, Wolsey, Laurence A.
    SIAM Journal on Optimization, 2011, Vol.21(4), pp.1594-1613 [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: Mixing Sets Linked by Bidirected Paths
    Auteur: Di Summa, Marco; Wolsey, Laurence A.
    Sujet: 90c11 ; 90c57 ; Mixed-Integer Programming ; Mixing Sets ; Convex Hull Descriptions ; Lot-Sizing
    Description: Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related sets arising in uncapacitated and constant capacity lot-sizing. This in turn has led to study of more general sets, called network-dual sets, for which it is possible to derive extended formulations whose projection gives the convex hull of the network-dual set. Unfortunately this formulation cannot be used (in general) to optimize in polynomial time. Furthermore the inequalities defining the convex hull of a network-dual set in the original space of variables are known only for some special cases. Here we study two new cases, in which the continuous variables of the network-dual set are linked by a bidirected path. In the first case, which is motivated by lot-sizing problems with (lost) sales, we provide a description of the convex hull as the intersection of the convex hulls of $2^n$ mixing sets, where is the number of continuous variables of the set. However optimization is polynomial as only $n+1$ of the sets are required for any given objective function. In the second case, generalizing single arc flow sets, we describe again the convex hull as the intersection of an exponential number of mixing sets and also give a combinatorial polynomial-time separation algorithm.
    Fait partie de: SIAM Journal on Optimization, 2011, Vol.21(4), pp.1594-1613
    Identifiant: 1052-6234 (ISSN); 1095-7189 (E-ISSN); 10.1137/100811799 (DOI)

    • Plusieurs versions

    Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

    Wolsey, Laurence A.
    Management Science, 1 December 2002, Vol.48(12), pp.1587-1602 [Revue évaluée par les pairs]

    • Article
    Sélectionner

    Tight MIP formulations for bounded up/down times and interval-dependent start-ups

    Queyranne, Maurice, Wolsey, Laurence A.
    Mathematical Programming, 10/31/2016 [Revue évaluée par les pairs]
    Springer (via CrossRef)
    Disponible
    Plus…
    Titre: Tight MIP formulations for bounded up/down times and interval-dependent start-ups
    Auteur: Queyranne, Maurice; Wolsey, Laurence A.
    Sujet: Machinery ; Startups ; Business Schools;
    Description: To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s10107-016-1079-2 Byline: Maurice Queyranne (1,2), Laurence A. Wolsey (1) Keywords: Production sequencing; Unit commitment; Bounded up/down times; Interval-dependent startups; Tight MIP formulations; Convex hulls; C44; C61 Abstract: Switching machines on and off is an important aspect of unit commitment problems and production planning problems, among others. Here we study tight mixed integer programming formulations for two aspects of such problems: bounded length on- and off-intervals, and interval-dependent start-ups. The problem with both these aspects admits a general Dynamic Programming (shortest path) formulation which leads to a tight extended formulation with a number of binary variables that is quadratic in the number n of time periods. We are thus interested in tight formulations with a linear number of binary variables. For the bounded interval problem we present a tight network dual formulation based on new integer cumulative variables that allows us to simultaneously treat lower and upper bounds on the interval lengths and also to handle time-varying bounds. This in turn leads to more general results, including simpler proofs of known tight formulations for problems with just lower bounds. For the interval-dependent start-up problem we develop a path formulation that allows us to describe the convex hull of solutions in the space of machine state variables and interval-dependent start-up variables. Author Affiliation: (1) CORE, Universite catholique de Louvain, Louvain-la-Neuve, Belgium (2) Sauder School of Business, University of British Columbia, Vancouver, Canada Article History: Registration Date: 11/10/2016 Received Date: 29/07/2015 Accepted Date: 11/10/2016 Online Date: 31/10/2016 Article note: This research has been funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office.
    Fait partie de: Mathematical Programming, 10/31/2016
    Identifiant: 0025-5610 (ISSN); 1436-4646 (E-ISSN); http (DOI)

    • Plusieurs versions

    Optimum turn-restricted paths, nested compatibility, and optimum convex polygons

    Queyranne, Maurice, Wolsey, Laurence
    Journal of Combinatorial Optimization, 2018, Vol.36(1), pp.90-107 [Revue évaluée par les pairs]