Imagen de Portada

Contribution to Blocker and Interdiction optimization problems in networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Martin, Sébastien
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
por: Matuschke, Jannik
Publicado: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
por: Wang, Changjun, et al.
Publicado: (2026)

Interdiction of minimum spanning trees and other matroid bases
por: Weninger, Noah, et al.
Publicado: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Pricing Filtering in Dantzig-Wolfe Decomposition
por: Mehamdi, Abdellah Bulaich, et al.
Publicado: (2024)

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
por: Martin, Sébastien, et al.
Publicado: (2025)

Alternative paths computation for congestion mitigation in segment-routing networks
por: Martin, Sébastien, et al.
Publicado: (2024)

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
por: Lai, Xiangjing, et al.
Publicado: (2024)

Revisiting some classical linearizations of the quadratic binary optimization problem
por: Punnen, Abraham P., et al.
Publicado: (2024)

Decision problems on geometric tilings
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2024)

Continuous optimization methods for the graph isomorphism problem
por: Klus, Stefan, et al.
Publicado: (2023)

Trapping and commutative Boolean networks
por: Gadouleau, Maximilien
Publicado: (2026)

Near-optimal edge partitioning via intersecting families
por: Yakunin, Alexander, et al.
Publicado: (2025)

The formula for the completion time of project networks
por: Castejón-Limas, Manuel, et al.
Publicado: (2024)

Pairwise similarity method for majority domination problem
por: Shushko, N. I., et al.
Publicado: (2025)

Phenotype control and elimination of variables in Boolean networks
por: Tonello, Elisa, et al.
Publicado: (2024)

Soft happy colourings and community structure of networks
por: Shekarriz, Mohammad H., et al.
Publicado: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
por: Del Pia, Alberto
Publicado: (2025)

Extended formulations for the maximum weighted co-2-plex problem
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2025)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
por: Montanez-Barrera, Alejandro, et al.
Publicado: (2022)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
por: Schwieger, Robert, et al.
Publicado: (2023)

A Boolean encoding of the Most Permissive semantics for Boolean networks
por: de Chancel, Laure, et al.
Publicado: (2026)

Creation of fixed points in block-parallel Boolean automata networks
por: Perrot, Kévin, et al.
Publicado: (2025)

Majority Boolean networks classifying density: structural characterization and complexity
por: Perrot, Kévin, et al.
Publicado: (2026)

Agglomeration based influential node ranking in path-type networks
por: Berberler, Zeynep Nihan, et al.
Publicado: (2025)

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
por: Santos, Daniela Scherer dos, et al.
Publicado: (2024)

An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters
por: Donne, Diego Delle, et al.
Publicado: (2024)

C sequential optimization numbers
por: Hui, Zile
Publicado: (2024)

On near optimal colorable graphs
por: Angeliya, C. U., et al.
Publicado: (2025)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
por: Perrotin, Pacôme, et al.
Publicado: (2024)

The Hajnal--Rothschild problem
por: Frankl, Peter, et al.
Publicado: (2025)

The average size of maximal matchings in graphs
por: Hertz, Alain, et al.
Publicado: (2022)

PHOEG: an online tool for discovery and education in extremal graph theory
por: Bonte, Sébastien, et al.
Publicado: (2026)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
por: Hertz, Alain, et al.
Publicado: (2021)

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels
por: Bourgeais, Quentin, et al.
Publicado: (2025)

Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
por: Espinoza, Alonso, et al.
Publicado: (2025)

Three aspects of the MSTCI problem
por: Dubinsky, Manuel, et al.
Publicado: (2023)

Solving decision problems by distributed consensus with one-dimensional, binary, radius-$2$ cellular automata over cyclic configurations
por: Ruivo, Eurico, et al.
Publicado: (2025)

On the complexity of freezing automata networks of bounded pathwidth
por: Goles, Eric, et al.
Publicado: (2025)

The red-blue-yellow matching problem
por: Aprile, Manuel, et al.
Publicado: (2026)