Image de couverture de livre

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baeckelant, Timothy, Vandaele, Arnaud, Gillis, Nicolas
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
par: Kang, Wonwoo, et autres
Publié: (2024)

Shortest Paths in Graphs of Convex Sets
par: Marcucci, Tobia, et autres
Publié: (2021)

Rank-one Boolean tensor factorization and the multilinear polytope
par: Del Pia, Alberto, et autres
Publié: (2022)

On Circuit Diameter Bounds via Circuit Imbalances
par: Dadush, Daniel, et autres
Publié: (2021)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
par: Lee, Jae Hyeok, et autres
Publié: (2026)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
par: Bernardelli, Ambrogio Maria, et autres
Publié: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
par: Costandin, Marius, et autres
Publié: (2023)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
par: Lozano, Leonardo, et autres
Publié: (2022)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
par: Schade, Jamico, et autres
Publié: (2023)

On Supportedness in Multi-Objective Combinatorial Optimization
par: Könen, David, et autres
Publié: (2025)

Assortment Optimization For Conference Goodies With Indifferent Attendees
par: Gutiérrez, Fernanda, et autres
Publié: (2024)

A Knowledge Compilation Take on Binary Polynomial Optimization
par: Capelli, Florent, et autres
Publié: (2023)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
par: Vercesi, Eleonora, et autres
Publié: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
par: Tellache, Nour ElHouda, et autres
Publié: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
par: Moldenhauer, Carsten, et autres
Publié: (2025)

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

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
par: Alidaee, Bahram, et autres
Publié: (2024)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
par: Figueira, José Rui, et autres
Publié: (2024)

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

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
par: Bussemaker, Jasper H., et autres
Publié: (2025)

Convex mixed-integer optimization with Frank-Wolfe methods
par: Hendrych, Deborah, et autres
Publié: (2022)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
par: Wang, Changjun, et autres
Publié: (2026)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
par: Jabbari-Marand, Behnam, et autres
Publié: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
par: Lucci, Mauro, et autres
Publié: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
par: Bangerter, Elise, et autres
Publié: (2026)

Minimum Cut Representability of Stable Matching Problems
par: Faenza, Yuri, et autres
Publié: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)

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

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
par: Haslinger, Xenia, et autres
Publié: (2025)

Factorized binary polynomial optimization
par: Del Pia, Alberto
Publié: (2024)

Projection-width as a structural parameter for discrete separable optimization
par: Del Pia, Alberto
Publié: (2025)

Chorded cycle facets of the clique partitioning polytope
par: Irmai, Jannik, et autres
Publié: (2024)