Copertina

On the redundancy of transitivity constraints in the clique partitioning problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Sukegawa, Noriyoshi
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Discrete Mathematics 90C10, 90C27, 05C85
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
di: McFarland, Caleb
Pubblicazione: (2026)

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)

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

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

Cluster deletion and clique partitioning in graphs with bounded clique number
di: Galesi, Nicola, et al.
Pubblicazione: (2025)

Supermodular Maximization with Cardinality Constraints
di: Chen, Xujin, et al.
Pubblicazione: (2025)

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

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
di: Masing, Berenike, 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 simple iterative algorithm for maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2018)

Continuous iterative algorithms for anti-Cheeger cut
di: Shao, Sihong, et al.
Pubblicazione: (2021)

Small-scale operations on graphic sequences
di: Rusu, Irena
Pubblicazione: (2026)

Large independent sets in recursive Markov random graphs
di: Gupte, Akshay, et al.
Pubblicazione: (2022)

Competing for the most profitable tour: The orienteering interdiction game
di: Álvarez-Miranda, Eduardo, et al.
Pubblicazione: (2024)

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

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

Implied Integrality in Mixed-Integer Optimization
di: van der Hulst, Rolf, et al.
Pubblicazione: (2025)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
di: Chiarelli, Nina, et al.
Pubblicazione: (2023)

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

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

The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach
di: Bomze, Immanuel, et al.
Pubblicazione: (2026)

Weighted domination models and randomized heuristics
di: Dijkstra, Lukas, et al.
Pubblicazione: (2022)

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

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

Infinite families of planar graphs of a given injective chromatic number
di: Daneels, Matias, et al.
Pubblicazione: (2024)

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

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

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

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

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

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
di: Pozo, Miguel A., et al.
Pubblicazione: (2022)

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

Computational methods for finding bi-regular cages
di: Goedgebeur, Jan, et al.
Pubblicazione: (2024)

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

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

Heuristic algorithms for the stochastic critical node detection problem
di: Bayarsaikhan, Tuguldur, et al.
Pubblicazione: (2025)

Fixed Topology Minimum-Length Trees with Neighborhoods
di: Blanco, Víctor, et al.
Pubblicazione: (2024)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
di: Gaar, Elisabeth, et al.
Pubblicazione: (2022)