Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    b3kat_BV049725057
    Umfang: 1 Online-Ressource (XIII, 418 p. 88 illus., 51 illus. in color)
    Ausgabe: 1st ed. 2024
    ISBN: 9783031609244
    Serie: Lecture Notes in Computer Science 14594
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-60923-7
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-60925-1
    Sprache: Englisch
    URL: Volltext  (URL des Erstveröffentlichers)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    almahu_9949744232402882
    Umfang: XIII, 418 p. 88 illus., 51 illus. in color. , online resource.
    Ausgabe: 1st ed. 2024.
    ISBN: 9783031609244
    Serie: Lecture Notes in Computer Science, 14594
    Inhalt: 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.
    Anmerkung: 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.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783031609237
    Weitere Ausg.: Printed edition: ISBN 9783031609251
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783031069444?
Meinten Sie 9783031159244?
Meinten Sie 9783031069246?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz