:: Library Catalog

Imatge de la portada

Guardat en:

Dades bibliogràfiques
Autors principals:	Del Pia, Alberto, Zhou, Dekun
Format:	Preprint
Publicat:	2022
Matèries:	Optimization and Control Discrete Mathematics
Accés en línia:	https://arxiv.org/abs/2203.02607
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars

The Mixed Integer Trust Region Problem
per: Del Pia, Alberto
Publicat: (2024)

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

Factorized binary polynomial optimization
per: Del Pia, Alberto
Publicat: (2024)

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

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
per: Del Pia, Alberto, et al.
Publicat: (2025)

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

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

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

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

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

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

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

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

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

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

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

Minimum 0-Extension Problems on Directed Metrics
per: Hirai, Hiroshi, et al.
Publicat: (2020)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
per: Lee, Jae Hyeok, et al.
Publicat: (2026)

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

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
per: Moon, Kyungduk, et al.
Publicat: (2026)

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

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

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

Sparse Approximation in Lattices and Semigroups
per: Kuhlmann, Stefan, et al.
Publicat: (2024)

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

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

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

Strong SDP based bounds on the cutwidth of a graph
per: Gaar, Elisabeth, et al.
Publicat: (2023)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
per: Lozano, Leonardo, et al.
Publicat: (2022)

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

Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs
per: Harfouche, Rayan, et al.
Publicat: (2024)

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

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
per: Bussemaker, Jasper H., et al.
Publicat: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
per: Schade, Jamico, et al.
Publicat: (2023)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
per: Del Pia, Alberto
Publicat: (2023)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
per: Wang, Haibo, et al.
Publicat: (2024)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
per: Harks, Tobias, et al.
Publicat: (2021)

Integer programs with bounded subdeterminants and two nonzeros per row
per: Fiorini, Samuel, et al.
Publicat: (2021)

Integer programs with nearly totally unimodular matrices: the cographic case
per: Aprile, Manuel, et al.
Publicat: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
per: Au, Yu Hin, et al.
Publicat: (2025)