Imagen de Portada

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Changjun, Wang, Chenhao
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)

Bond Polytope under Vertex- and Edge-sums
por: Kolman, Petr, et al.
Publicado: (2026)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
por: Liu, Haoyue, et al.
Publicado: (2025)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)

On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
por: Marić, Nevena
Publicado: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
por: Alidaee, Bahram, et al.
Publicado: (2024)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025)

Vertex-ordering and arc-partitioning problems
por: Borsik, Nóra A., et al.
Publicado: (2025)

Arithmetic Circuits and Neural Networks for Regular Matroids
por: Hertrich, Christoph, et al.
Publicado: (2025)

On the Virtual Network Embedding polytope
por: Benhamiche, Amal, et al.
Publicado: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
por: Jabbari-Marand, Behnam, et al.
Publicado: (2026)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
por: Baeckelant, Timothy, et al.
Publicado: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
por: Lucci, Mauro, et al.
Publicado: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
por: Bangerter, Elise, et al.
Publicado: (2026)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
por: Lee, Jae Hyeok, et al.
Publicado: (2026)

Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, et al.
Publicado: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Geoffrion's theorem beyond finiteness and rationality
por: Dey, Santanu S., et al.
Publicado: (2025)

Shortest Paths in Graphs of Convex Sets
por: Marcucci, Tobia, et al.
Publicado: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)

Order acceptance and scheduling in capacitated job shops
por: Linß, Florian, et al.
Publicado: (2024)

A review of minimum cost box searching games
por: Lidbetter, Thomas
Publicado: (2025)

Market proliferation and the impact of locational complexity on network restructuring
por: Pinar-Pérez, J. M., et al.
Publicado: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
por: Könen, David, et al.
Publicado: (2025)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
por: Swamy, Rahul, et al.
Publicado: (2024)

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

An exact approach for the multi-depot electric vehicle scheduling problem
por: Haslinger, Xenia, et al.
Publicado: (2025)

Factorized binary polynomial optimization
por: Del Pia, Alberto
Publicado: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
por: Del Pia, Alberto, et al.
Publicado: (2022)

Projection-width as a structural parameter for discrete separable optimization
por: Del Pia, Alberto
Publicado: (2025)

Chorded cycle facets of the clique partitioning polytope
por: Irmai, Jannik, et al.
Publicado: (2024)

Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
por: Del Pia, Alberto, et al.
Publicado: (2024)

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

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
por: Wu, Fei, et al.
Publicado: (2024)

Extended formulations for the multilinear polytope of acyclic hypergraphs
por: Del Pia, Alberto, et al.
Publicado: (2025)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022)