Mostrar el registro sencillo del ítem

hal.structure.identifierDepartment of Mathematical Sciences [Clemson]
dc.contributor.authorBELOTTI, Pietro
hal.structure.identifierENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien [MAIAA]
dc.contributor.authorCAFIERI, Sonia
hal.structure.identifierDepartment of Mathematical Sciences, TJ Watson
dc.contributor.authorLEE, Jon
hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
dc.contributor.authorLIBERTI, Leo
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorMILLER, Andrew J.
dc.date.accessioned2024-04-04T02:23:22Z
dc.date.available2024-04-04T02:23:22Z
dc.date.issued2013
dc.identifier.isbn978-1-4614-5130-3
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/189732
dc.description.abstractEnWithin the framework of the spatial Branch-and-Bound algorithm for solving mixed-integer nonlinear programs, different convex relaxations can be obtained for multilinear terms by applying associativity in different ways. The two groupings ((x1x2)x3)x4 and (x1x2x3)x4 of a quadrilinear term, for example, give rise to two different convex relaxations. In Cafieri et al. (J Global Optim 47:661-685, 2010) we prove that having fewer groupings of longer terms yields tighter convex relaxations. In this chapter we give an alternative proof of the same fact and perform a computational study to assess the impact of the tightened convex relaxation in a spatial Branch-and-Bound setting.
dc.language.isoen
dc.publisherSpringer Verlag
dc.source.titleOptimization, Simulation, and Control
dc.subject.enquadrilinear
dc.subject.enconvex relaxation
dc.subject.enreformulation
dc.subject.englobal optimization
dc.subject.enspatial branch-and-bound
dc.subject.enMINLP
dc.title.enOn the composition of convex envelopes for quadrilinear terms
dc.typeChapitre d'ouvrage
dc.identifier.doi10.1007/978-1-4614-5131-0_1
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.pagepp 1-16
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.title.proceedingOptimization, Simulation, and Control
hal.identifierhal-00769671
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00769671v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Optimization,%20Simulation,%20and%20Control&rft.date=2013&rft.spage=pp%201-16&rft.epage=pp%201-16&rft.au=BELOTTI,%20Pietro&CAFIERI,%20Sonia&LEE,%20Jon&LIBERTI,%20Leo&MILLER,%20Andrew%20J.&rft.isbn=978-1-4614-5130-3&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem