Copertina

The complete edge relaxation for binary polynomial optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Del Pia, Alberto, Khajavirad, Aida
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
di: Del Pia, Alberto, et al.
Pubblicazione: (2024)

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

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

Factorized binary polynomial optimization
di: Del Pia, Alberto
Pubblicazione: (2024)

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

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

The Mixed Integer Trust Region Problem
di: Del Pia, Alberto
Pubblicazione: (2024)

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

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

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

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

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

Inference in higher-order undirected graphical models and binary polynomial optimization
di: Khajavirad, Aida, et al.
Pubblicazione: (2024)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
di: Khajavirad, Aida
Pubblicazione: (2026)

Quantum algorithms for optimizers
di: Nannicini, Giacomo
Pubblicazione: (2024)

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

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

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

A review of minimum cost box searching games
di: Lidbetter, Thomas
Pubblicazione: (2025)

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

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

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

Aircraft routing: periodicity and complexity
di: Meunier, Frédéric, et al.
Pubblicazione: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
di: Besançon, Mathieu
Pubblicazione: (2025)

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
di: Hof, Hugo A., et al.
Pubblicazione: (2025)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
di: Nishida, Yuki
Pubblicazione: (2025)

Linear Programming Hierarchies Collapse under Symmetry
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
di: Petersen, Bjørn, et al.
Pubblicazione: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
di: Thomas, Helen, et al.
Pubblicazione: (2025)

Scheduling on identical machines with conflicts to minimize the mean flow time
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

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

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

Tree-based formulation for the multi-commodity flow problem
di: Spoorendonk, Simon, et al.
Pubblicazione: (2025)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
di: Hu, Hins, et al.
Pubblicazione: (2025)

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

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

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