Imagen de Portada

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Swamy, Rahul, King, Douglas M., Jacobson, Sheldon H.
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
por: Li, Zongji, et al.
Publicado: (2023)

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

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)

Branch and Price for the Length-Constrained Cycle Partition Problem
por: Ghannam, Mohammed, et al.
Publicado: (2024)

A Tight Formulation for the Dial-a-Ride Problem
por: Gaul, Daniela, et al.
Publicado: (2023)

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

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

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

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
por: Villa, Tullio, et al.
Publicado: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
por: Besançon, Mathieu
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)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)

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

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

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

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)

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

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

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)

Assortment Optimization For Conference Goodies With Indifferent Attendees
por: Gutiérrez, Fernanda, et al.
Publicado: (2024)

The Mixed Integer Trust Region Problem
por: Del Pia, Alberto
Publicado: (2024)

Benders decomposition for congested partial set covering location with uncertain demand
por: Calamita, Alice, et al.
Publicado: (2024)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
por: Brandstetter, Christof, et al.
Publicado: (2024)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
por: Fouilhoux, Pierre, et al.
Publicado: (2024)

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)

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

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

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

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

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)

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)

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