Cover Image

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Del Pia, Alberto, Khajavirad, Aida
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

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

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

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

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

The Mixed Integer Trust Region Problem
by: Del Pia, Alberto
Published: (2024)

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

A Knowledge Compilation Take on Binary Polynomial Optimization
by: Capelli, Florent, et al.
Published: (2023)

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

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
by: Lai, Xiangjing, et al.
Published: (2024)

Boolean Variation and Boolean Logic BackPropagation
by: Nguyen, Van Minh
Published: (2023)

Quantum algorithms for optimizers
by: Nannicini, Giacomo
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

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

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

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

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

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