00974nam0 22002771i 450 UON0034581420231205104319.8103-303-0406-220091117d1987 |0itac50 baengGB|||| 1||||ˆThe ‰child in timeIan McEwanLondonPan Books in association with Jonathan Cape1987220 p.20 cm.GBLondonUONL003044823.914Narrativa inglese, 1945-199921McEWANIanUONV118006176014CapeUONV251887650Pan BooksUONV252176650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00345814SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI Angl VI A McEW 03 SI LO 43434 5 03 Child in time16569UNIOR04204nam 22006975 450 991030010230332120200702031814.03-030-00148-210.1007/978-3-030-00148-3(CKB)4100000007181149(MiAaPQ)EBC5606692(DE-He213)978-3-030-00148-3(PPN)232474222(EXLCZ)99410000000718114920181127d2018 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierDisjunctive Programming /by Egon Balas1st ed. 2018.Cham :Springer International Publishing :Imprint: Springer,2018.1 online resource (238 pages)3-030-00147-4 1 Disjunctive programming and its relation to integer programming -- 2 The convex hull of a disjunctive set -- 3 Sequential convexification of disjunctive sets -- 4 Moving between conjunctive and disjunctive normal forms -- 5 Disjunctive programming and extended formulations -- 6 Lift-and-project cuts for mixed 0-1 programs -- 7 Nonlinear higher-dimensional representations -- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts -- 9 Solving (CGLP)k on the LP simplex tableau -- 10 Implementation and testing of variants -- 11 Cuts from general disjunctions -- 12 Disjunctive cuts from the V -polyhedral representation -- 13 Unions of polytopes in different spaces -- References.Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business. .Matrix theoryAlgebraGame theoryAlgorithmsCombinatorial analysisMathematical optimizationOperations researchDecision makingLinear and Multilinear Algebras, Matrix Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/M11094Game Theory, Economics, Social and Behav. Scienceshttps://scigraph.springernature.com/ontologies/product-market-codes/M13011Algorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26008Operations Research/Decision Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/521000Matrix theory.Algebra.Game theory.Algorithms.Combinatorial analysis.Mathematical optimization.Operations research.Decision making.Linear and Multilinear Algebras, Matrix Theory.Game Theory, Economics, Social and Behav. Sciences.Algorithms.Combinatorics.Optimization.Operations Research/Decision Theory.519.77Balas Egonauthttp://id.loc.gov/vocabulary/relators/aut768231BOOK9910300102303321Disjunctive Programming1564707UNINA