01152nam0 22002773i 450 VAN026212120230728085131.373978-88-386-5495-420230728d2022 |0itac50 baitaIT|||| |||||Python e machine learningAlessandro Bellini, Andrea GuidiMilanoMcGraw-Hill2022XIX, 331 p.ill.24 cmMilanoVANL000284BelliniAlessandro1983- VANV21657766787GuidiAndreaVANV21657862847McGraw Hill <editore>VANV108035650ITSOL20240503RICAhttps://www.mheducation.it/python-e-machine-learning-1-ed-9788838654954-italyhttps://www.mheducation.it/python-e-machine-learning-1-ed-9788838654954-italyBIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIAIT-CE0100VAN05VAN0262121BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST E 318 05UBI1823 20230728 BuonoPython e machine learning2864155UNICAMPANIA05341nam 22008175 450 991063108550332120251113181950.09783031185304303118530710.1007/978-3-031-18530-4(MiAaPQ)EBC7143809(Au-PeEL)EBL7143809(CKB)25430587200041(PPN)266348262(OCoLC)1352866036(DE-He213)978-3-031-18530-4(EXLCZ)992543058720004120221120d2022 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierCombinatorial Optimization 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /edited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub1st ed. 2022.Cham :Springer International Publishing :Imprint: Springer,2022.1 online resource (340 pages)Lecture Notes in Computer Science,1611-3349 ;13526Print version: Ljubić, Ivana Combinatorial Optimization Cham : Springer International Publishing AG,c2022 9783031185298 Includes bibliographical references and index.Polyhedra and Algorithms -- New classes of facets for complementarity knapsack problems -- Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints -- The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm -- Polyhedra and Combinatorics -- Top-$k$ List Aggregation: Mathematical Formulations and Polyhedral Comparisons -- Bounded variation in binary sequences -- On Minimally Non-Firm Binary Matrices -- Few Induced Disjoint Paths for H-Free Graphs -- On Permuting some Coordinates of Polytopes -- Non-linear Optimization -- Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error -- An outer-approximation algorithm for maximum-entropy sampling -- Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization -- Game Theory -- Exact Price of Anarchy for Weighted Congestion Games with Two Players.-Nash balanced assignment problem -- Graphs and Trees -- On the thinness of trees -- Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms -- Cutting and Packing -- High Multiplicity Strip Packing with Three Rectangle Types -- Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions -- Applications -- One transfer per patient suffices: Structural insights about patient-to-room assignment -- Tool switching problems in the context of overlay printing with multiple colours -- Optimal Vaccination Strategies for Multiple Dose Vaccinations -- Approximation Algorithms -- Pervasive Domination -- Unified Greedy Approximability Beyond Submodular Maximization -- Neighborhood persistency of the linear optimization relaxation of integer linear optimization -- Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines.This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022. The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.Lecture Notes in Computer Science,1611-3349 ;13526Computer scienceMathematicsDiscrete mathematicsComputer networksAlgorithmsData structures (Computer science)Information theoryNumerical analysisArtificial intelligenceDiscrete Mathematics in Computer ScienceComputer Communication NetworksDesign and Analysis of AlgorithmsData Structures and Information TheoryNumerical AnalysisArtificial IntelligenceComputer scienceMathematics.Discrete mathematics.Computer networks.Algorithms.Data structures (Computer science)Information theory.Numerical analysis.Artificial intelligence.Discrete Mathematics in Computer Science.Computer Communication Networks.Design and Analysis of Algorithms.Data Structures and Information Theory.Numerical Analysis.Artificial Intelligence.519.64519.64Ljubic IvanaMiAaPQMiAaPQMiAaPQBOOK9910631085503321Combinatorial optimization262324UNINA