Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Baeckelant, Timothy, Vandaele, Arnaud, Gillis, Nicolas
Formato:	Preprint
Publicado:	2026
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

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
por: Kang, Wonwoo, et al.
Publicado: (2024)

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

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

On Circuit Diameter Bounds via Circuit Imbalances
por: Dadush, Daniel, et al.
Publicado: (2021)

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

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)

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

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

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

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

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

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

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
por: Vercesi, Eleonora, 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)

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

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, 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)

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

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

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

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
por: Figueira, José Rui, et al.
Publicado: (2024)

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

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

Convex mixed-integer optimization with Frank-Wolfe methods
por: Hendrych, Deborah, et al.
Publicado: (2022)

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

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

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

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

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
por: Bangerter, Elise, et al.
Publicado: (2026)

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

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

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

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)

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

An exact approach for the multi-depot electric vehicle scheduling problem
por: Haslinger, Xenia, 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)

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