libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

basu amitabh (curatore); mahjoub ali ridha (curatore); salazar gonzález juan josé (curatore) - combinatorial optimization
Zoom

Combinatorial Optimization 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers

; ;




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
80,98 €
NICEPRICE
76,93 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Editore:

Springer

Pubblicazione: 05/2024
Edizione: 2024





Trama

This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22–24, 2024.

The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications.





Sommario

Integer Programming.- On disjunction convex hulls by lifting.- On a geometric graph-covering problem related to optimal safety-landing site location.- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem.- A Family of Spanning-Tree Formulations for the Maximum Cut Problem.- Optimal cycle selections: An experimental assessment of integer programming formulations.- 1-Persistency of the clique relaxation of the stable set polytope.- Alternating direction method and deep learning for discrete control with storage.- Branch and Cut for Partitioning a Graph into a Cycle of Clusters.- Graph Theory.- Computing the Edge Expansion of a Graph using Semidefinite Programming.- Minimizing External Vertices in Hypergraph Orientations.- Open-separating dominating codes in graphs.- On the complexity of the minimum chromatic violation problem.- Crystal Trees.- Parameterized Algorithms.- Reducing Treewidth for SAT-related Problems using Simple Liftings.- Total Matching and Subdeterminants.- A new structural parameter on single machine scheduling with release dates and deadlines.- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs.- Approximation Algorithms.- Sequencing Stochastic Jobs with a Single Sample.- The Thief Orienteering Problem on Series-Parallel Graphs.- Approximation Algorithm for Job Scheduling with Reconfigurable Resources.- Network Design on Undirected Series-Parallel Graphs.- Online Graph Coloring with Predictions.- Integer Programming for Machine Learning.- Neuron pairs in binarized neural networks robustness verification via integer linear programming.- Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming.- Applications.- Surrogate Constraints for Synchronized Energy Production/Consumption.- A Robust Two-stage Model For the Urban Air Mobility Flight Scheduling Problem.- Optimal charging station location in a linear cycle path with deviations.- An efficient timing algorithm for drivers with rest periods.- Fair Energy Allocation for Collective Self-Consumption.- Day-ahead lot-sizing under uncertainty: An application to green hydrogen production.











Altre Informazioni

ISBN:

9783031609237

Condizione: Nuovo
Collana: Lecture Notes in Computer Science
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:XIII, 418 p. 88 illus., 51 illus. in color.
Pagine Arabe: 418
Pagine Romane: xiii


Dicono di noi