arXiv (All)
open access
Global Optimization of Mixed-Integer Bound-Constrained Quadratic Fractional Problems
We study mixed-integer quadratic fractional optimization problems with binary and continuous box-constrained variables. The objective is the ratio of two quadratic functions, a structure that arises naturally in portfolio selection, signal processing, and data analytics. We propose an exact algorith
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Integer-Forcing Precoding: A Geometric Perspective and Low-Complexity Algorithm Design#1297043
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- Semidefinite Programming for Quantum Channel Learning#998084
- Compressed Traffic Assignment with the Augmented Lagrangian Method#1105975
- QuanVI: Score-based Variational Inference via Quantum Maximally Mixed States#1144131
Record · ID 1200406
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive