Imagen de Portada

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Del Pia, Alberto, Khajavirad, Aida
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

Separable convex optimization over indegree polytopes
por: Borsik, Nóra A., et al.
Publicado: (2025)

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

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

Boolean Variation and Boolean Logic BackPropagation
por: Nguyen, Van Minh
Publicado: (2023)

Complexity of polytope diameters via perfect matchings
por: Nöbel, Christian, et al.
Publicado: (2024)

Quantum algorithms for optimizers
por: Nannicini, Giacomo
Publicado: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
por: Costandin, Marius, et al.
Publicado: (2023)

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

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
por: Ketkov, Sergey S.
Publicado: (2023)

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

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

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

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

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

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)

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)

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

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

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

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

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