Copertina

Heuristic algorithms for the stochastic critical node detection problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bayarsaikhan, Tuguldur, Chinchuluun, Altannar, Arulselvan, Ashwin, Pardalos, Panos
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Discrete Mathematics Machine Learning 90C27, 90C15, 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

Extending the definition of set tolerances
di: Jäger, Gerold, et al.
Pubblicazione: (2024)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
di: Tanaka, Masato, et al.
Pubblicazione: (2021)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
di: Gaar, Elisabeth, et al.
Pubblicazione: (2024)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
di: Ammann, Sabrina C. L., et al.
Pubblicazione: (2024)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
di: Bui, Quang Minh, et al.
Pubblicazione: (2024)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
di: Gaar, Elisabeth
Pubblicazione: (2020)

Strong SDP based bounds on the cutwidth of a graph
di: Gaar, Elisabeth, et al.
Pubblicazione: (2023)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
di: Heinz, Vilém, et al.
Pubblicazione: (2025)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
di: Cameron, Thomas R., et al.
Pubblicazione: (2025)

On the redundancy of transitivity constraints in the clique partitioning problem
di: Sukegawa, Noriyoshi
Pubblicazione: (2026)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
di: Tanınmış, Kübra, et al.
Pubblicazione: (2023)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
di: Gonçalves-Dosantos, Juan Carlos, et al.
Pubblicazione: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
di: Masing, Berenike, et al.
Pubblicazione: (2024)

Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
di: Mucke, Tom, et al.
Pubblicazione: (2024)

Moment generating functions in combinatorial optimization: Bipartite matching
di: Wästlund, Johan
Pubblicazione: (2026)

Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection
di: Aref, Samin, et al.
Pubblicazione: (2023)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
di: Yang, Dominic, et al.
Pubblicazione: (2025)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
di: Melnikov, Olena, et al.
Pubblicazione: (2024)

Disciplined Biconvex Programming
di: Zhu, Hao, et al.
Pubblicazione: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

A greedy heuristic for graph burning
di: García-Díaz, Jesús, et al.
Pubblicazione: (2024)

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem
di: Goldberg, Noam, et al.
Pubblicazione: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
di: Hoogervorst, Rowan, et al.
Pubblicazione: (2024)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Minimal $L^p$-congestion spanning trees on weighted graphs
di: Lafuente, Alberto Castejón, et al.
Pubblicazione: (2025)

Applying a Random-Key Optimizer on Mixed Integer Programs
di: Chaves, Antonio A., et al.
Pubblicazione: (2026)

Reducing Dominating Sets in Graphs
di: Inza, Ernesto Parra, et al.
Pubblicazione: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

Further results on the lower bound on reduced Zagreb index of trees
di: Bašić, Milan, et al.
Pubblicazione: (2026)

A solution procedure for minimizing total completion time in a parallel-batching environment
di: Alfieri, Arianna, et al.
Pubblicazione: (2020)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
di: Del Pia, Alberto
Pubblicazione: (2023)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Totally equimodular matrices: decomposition and triangulation
di: Chervet, Patrick, et al.
Pubblicazione: (2025)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
di: Robertson, Sawyer Jack, et al.
Pubblicazione: (2025)