000 05773nam a22006975i 4500
001 978-3-031-60924-4
003 DE-He213
005 20251030112053.0
007 cr nn 008mamaa
008 240522s2024 sz | s |||| 0|eng d
020 _a9783031609244
_9978-3-031-60924-4
024 7 _a10.1007/978-3-031-60924-4
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
245 1 0 _aCombinatorial Optimization
_h[electronic resource] :
_b8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers /
_cedited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXIII, 418 p. 88 illus., 51 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14594
505 0 _aInteger 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.
520 _aThis 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.
650 0 _aComputer science
_xMathematics.
_964041
650 0 _aDiscrete mathematics.
650 0 _aComputer networks .
_960157
650 0 _aAlgorithms.
_958677
650 0 _aData structures (Computer science).
_966708
650 0 _aInformation theory.
_957783
650 0 _aNumerical analysis.
650 0 _aArtificial intelligence.
_958441
650 1 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Communication Networks.
_965689
650 2 4 _aDesign and Analysis of Algorithms.
_967299
650 2 4 _aData Structures and Information Theory.
_966709
650 2 4 _aNumerical Analysis.
650 2 4 _aArtificial Intelligence.
_958441
700 1 _aBasu, Amitabh.
_eeditor.
_0(orcid)0000-0002-1070-2626
_1https://orcid.org/0000-0002-1070-2626
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_977240
700 1 _aMahjoub, Ali Ridha.
_eeditor.
_0(orcid)0000-0002-1079-1892
_1https://orcid.org/0000-0002-1079-1892
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_977241
700 1 _aSalazar González, Juan José.
_eeditor.
_0(orcid)0000-0001-5683-0271
_1https://orcid.org/0000-0001-5683-0271
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_977242
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031609237
776 0 8 _iPrinted edition:
_z9783031609251
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14594
856 4 0 _uhttps://doi.org/10.1007/978-3-031-60924-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
999 _c60039
_d60039