Cover Image

The rainbow covering number of clean tangled clutters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abdi, Ahmad, Cornuéjols, Gérard
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Optimization and Control 90C27, 90C57
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Integral bases, perfect matchings, and the Petersen graph
by: Abdi, Ahmad, et al.
Published: (2025)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Production optimization by agents of differing work rates
by: Higgins, Peter M.
Published: (2023)

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

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

Lower bounds for cube-ideal set-systems
by: Abdi, Ahmad, et al.
Published: (2025)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
by: Sinjorgo, Lennart, et al.
Published: (2025)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2025)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

Exact Decomposition Branching exploiting Lattice Structures
by: Halbig, Katrin, et al.
Published: (2024)

Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
by: Qilong, Yuan, et al.
Published: (2025)

Strongly connected orientations and integer lattices
by: Abdi, Ahmad, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

The Boolean polynomial polytope with multiple choice constraints
by: Shao, Sihong, et al.
Published: (2024)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

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

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

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)

Practical Experience with Stable Set and Coloring Relaxations
by: Pucher, Dunja, et al.
Published: (2024)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

Edge expansion of a graph: SDP-based computational strategies
by: Gupte, Akshay, et al.
Published: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

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