01262nam0 22003133i 450 SBL070213520231121125831.020200316d1973 ||||0itac50 bafrechz01i xxxe z01n˜La œpresse périodique française et l'Afrique barbaresque au 17. siècle (1611-1715)GenèveDroz1973189 p.24 cm.Histoire des idées et critique littéraire001BVE00008922001 Histoire des idées et critique littérairePeriodici francesiAfrica1611-1715FIRRMLC408070I054.121Turbet-Delof, GuySBLV305950070244806ITIT-0120200316IT-RM028 IT-FR0017 Biblioteca Universitaria AlessandrinaRM028 Biblioteca umanistica Giorgio ApreaFR0017 SBL0702135Biblioteca umanistica Giorgio Aprea 52MAG 2/1731 52MAG0000147775 VMB RS A 2020031620200316 01 52Presse périodique française et l'Afrique barbaresque au 17. siècle (1611-1715)3637235UNICAS04163nam 22007215 450 99666035930331620250503130159.0981-9644-48-810.1007/978-981-96-4448-3(CKB)38753867500041(DE-He213)978-981-96-4448-3(MiAaPQ)EBC32077320(Au-PeEL)EBL32077320(EXLCZ)993875386750004120250503d2025 u| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierCombinatorial Optimization and Applications 17th International Conference, COCOA 2024, Beijing, China, December 6–8, 2024, Proceedings, Part II /edited by Donglei Du, Lu Han, Dachuan Xu1st ed. 2025.Singapore :Springer Nature Singapore :Imprint: Springer,2025.1 online resource (XVI, 189 p. 25 illus., 20 illus. in color.) Lecture Notes in Computer Science,1611-3349 ;15435981-9644-47-X .-Maximizing One-Way Trading Revenue in Photovoltaic Energy Generation. -- Parameterized Complexity of Shortest Path with Positive Disjunctive Constraint. -- An Approximation Algorithm for the (Metric) Clustered Path Traveling Salesman Problem. -- Dynamic Algorithms for Submodular Maximization with a $p$-Matchoid Constraint. -- Generative Flow Networks with Symmetry Enhancement to Solve Vehicle Routing Problems. -- Edge-Unfolding Polycubes with Orthogonally Convex Layers. -- B-matching interdiction problem on bipartite graphs with unit weight and multi-dimensional budgets. -- Mechanism Design for Facility Location Games Under a Prelocated Facility. -- Computing approximate mixed Nash equilibria for symmetric weighted congestion games. -- Dynamic Algorithms for Non-monotone Submodular Maximization. -- Broadcasting and three list subtraction. -- The Power of Second Chance: Personalized Submodular Maximization with Two Candidates. -- (Independent) Roman Domination Parameterized by Distance to Cluster. -- Fair selection of clearing schemes for kidney exchange markets.The two-volume set, LNCS 15434 and 15435, constitutes the refereed post-conference proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2024, held in Beijing, China, during December 6–8, 2024. The 53 full papers included in the proceedings were carefully reviewed and selected from 124 submissions. They deal with combinatorial optimization and its applications, including algorithm design, theoretical and experimental analysis, and applied research of general algorithmic interest.Lecture Notes in Computer Science,1611-3349 ;15435Data structures (Computer science)Information theoryComputer scienceMathematicsArtificial intelligenceComputer graphicsComputer scienceData Structures and Information TheoryMathematics of ComputingArtificial IntelligenceComputer GraphicsTheory of ComputationData structures (Computer science)Information theory.Computer scienceMathematics.Artificial intelligence.Computer graphics.Computer science.Data Structures and Information Theory.Mathematics of Computing.Artificial Intelligence.Computer Graphics.Theory of Computation.005.73003.54Du Dongleiedthttp://id.loc.gov/vocabulary/relators/edtHan Luedthttp://id.loc.gov/vocabulary/relators/edtXu Dachuanedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996660359303316Combinatorial Optimization and Applications772251UNISA