Graphs and Combinatorial Optimization: from Theory to Applications
portes grátis
Graphs and Combinatorial Optimization: from Theory to Applications
CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22
Siegle, Markus; Brieden, Andreas; Pickl, Stefan
Springer International Publishing AG
02/2024
202
Dura
Inglês
9783031468254
15 a 20 dias
Descrição não disponível.
On syntactical graphs-of-words.- k-slow Burning: Complexity and Upper Bounds.- Exact approaches for the Connected Vertex Cover problem.- Handling Sub-symmetry in Integer Programming using Activation Handlers.- Online Facility Location: comparing ad-hoc and MIP-based algorithms.- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints.- The algorithmic complexity of the Paired Matching problem.- Edge Contraction and Forbidden Induced Subgraphs.- Rigidity of frameworks on spheres.- Discrepancies of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo Integration on a Union of Polytopes.- Managing Time Expanded Networks: The Strong Lift Problem.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Computer Science;Informatics;Conference Proceedings;Research;Applications;Combinatorial Optimization;Discrete Algorithms;Graph Problems;Cologne-Twente Workshop;Algorithms;Discrete Mathematics
On syntactical graphs-of-words.- k-slow Burning: Complexity and Upper Bounds.- Exact approaches for the Connected Vertex Cover problem.- Handling Sub-symmetry in Integer Programming using Activation Handlers.- Online Facility Location: comparing ad-hoc and MIP-based algorithms.- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints.- The algorithmic complexity of the Paired Matching problem.- Edge Contraction and Forbidden Induced Subgraphs.- Rigidity of frameworks on spheres.- Discrepancies of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo Integration on a Union of Polytopes.- Managing Time Expanded Networks: The Strong Lift Problem.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
