Imagen de Portada

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Alkhouri, Ismail, Wu, Mian, Yu, Cunxi, Liu, Jia, Wang, Rongrong, Velasquez, Alvaro
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Differentiable Quadratic Optimization For The Maximum Independent Set Problem
por: Alkhouri, Ismail, et al.
Publicado: (2024)

Mutation-Guided Differentiable Quadratic Combinatorial Optimization
por: Sun, Yongliang, et al.
Publicado: (2026)

Lower Bounds for Maximum Weighted Cut
por: Gutin, Gregory, et al.
Publicado: (2021)

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

Box Facets and Cut Facets of Lifted Multicut Polytopes
por: Naumann, Lucas Fabian, et al.
Publicado: (2024)

An approximation algorithm for Maximum DiCut vs. Cut
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2024)

Quantum Approaches to the Minimum Edge Multiway Cut Problem
por: Abbassi, Ali, et al.
Publicado: (2026)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
por: Prunet, Thibault, et al.
Publicado: (2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
por: Botler, F., et al.
Publicado: (2024)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
por: Au, Yu Hin, et al.
Publicado: (2023)

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

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
por: Au, Yu Hin, et al.
Publicado: (2020)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
por: Prasad, Siddharth, et al.
Publicado: (2024)

Improved Dynamics for the Maximum Common Subgraph Problem
por: Guidobene, Davide, et al.
Publicado: (2024)

Forward-Backward Binarization
por: Belgacem, Ismail, et al.
Publicado: (2025)

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

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
por: Su, E, et al.
Publicado: (2025)

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

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

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
por: Park, Seongbeom
Publicado: (2025)

Every Poset has a Large Cut
por: Linial, Nati, et al.
Publicado: (2025)

EPTAS for Hard Graph Cut Problems for Dense Graphs
por: Deguchi, Kaisei, et al.
Publicado: (2026)

Efficient Lifting of Discrete Logarithms Modulo Prime Powers
por: Viglietta, Giovanni, et al.
Publicado: (2025)

A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem
por: Soler, Joan Salvà, et al.
Publicado: (2025)

Pushing Cops and Robber on Graphs of Maximum Degree 4
por: Gahlawat, Harmender
Publicado: (2025)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
por: Sumnicht, Christopher, et al.
Publicado: (2024)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
por: Hauweele, Pierre, et al.
Publicado: (2018)

The Rainbow Arborescence Problem on Cycles
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Hierarchy of Hub Covering Problems
por: Jost, Niklas
Publicado: (2025)

Algorithms for the Global Domination Problem
por: Inza, Ernesto Parra, et al.
Publicado: (2023)

Probabilistic Methods on Erdos Problems
por: Gilbert, Jesse
Publicado: (2011)

The Fagnano Triangle Patrolling Problem
por: Georgiou, Konstantinos, et al.
Publicado: (2023)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
por: Gerke, Stefanie, et al.
Publicado: (2024)

The Unreliable Job Selection and Sequencing Problem
por: Agnetis, Alessandro, et al.
Publicado: (2025)

The EnvDesign Model: A Method to Solve the Environment Design Problem
por: Sathiya, Akshay, et al.
Publicado: (2024)

Maximum rectilinear convex subsets
por: González-Aguilar, Hernán, et al.
Publicado: (2019)

Multi-Agent Search-Type Problems on Polygons
por: Georgiou, Konstantinos, et al.
Publicado: (2024)

On the Hardness of Gray Code Problems for Combinatorial Objects
por: Merino, Arturo, et al.
Publicado: (2024)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
por: Sanghi, Aryan, et al.
Publicado: (2026)