On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

count % of corpus

6 results for “branch-and-cut”

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclusteringmath.OC

A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.

problem Finding dense disjoint bicliques in a weighted bipartite graph.

method Semidefinite programming-based branch-and-cut algorithm with upper and lower bounds.

result The algorithm can solve much larger instances than general-purpose solvers.

biclustering branch-and-cut semidefinite programming bipartite graph disjoint bicliques

2024-03-17abs ↗pdf ↗

Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programmingmath.OC

New algorithm solves large cardinality-constrained clustering problems.

problem Optimizing clustering with cardinality constraints.

method Branch-and-cut technique with SDP relaxation and polyhedral cuts.

result Solves real-world instances 10 times larger than previous methods.

clustering cardinality constraints SDP relaxation branch-and-cut global optimization

2022-09-19abs ↗pdf ↗

Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithmsquant-ph

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

problem Solving Mixed Integer Programs (MIPs) efficiently.

method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.

result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.

Quantum Computing Mixed Integer Programming Branch-and-Bound Tree Search NP-Hard Problems

2022-10-06abs ↗pdf ↗

ExDBN: Learning Dynamic Bayesian Networks using Extended Mixed-Integer Programming Formulationscs.LG

ExDBN learns dynamic Bayesian networks using mixed-integer programming.

problem Learning dynamic causal relationships from time series data.

method Score-based learning algorithm using mixed-integer quadratic programming with branch-and-cut method.

result The proposed method produces more accurate results than state-of-the-art approaches.

Bayesian networks dynamic causal modeling mixed-integer programming branch-and-cut time series analysis

2024-10-21abs ↗pdf ↗

Reinforcement Learning for Integer Programming: Learning to Cutcs.LG

Integer programming (IP) is a general optimization framework widely applicable to a variety of unstructured and structured problems arising in, e.g., scheduling, production planning, and graph optimization. As IP models many provably hard to solve problems, modern IP solvers rely on many heuristics. These heuristics ar…

2019-06-11abs ↗pdf ↗

ODTlearn: A Package for Learning Optimal Decision Trees for Prediction and Prescriptionstat.ML

ODTLearn learns optimal decision trees for predictive and prescriptive tasks.

problem Learning optimal decision trees for high-stakes predictive and prescriptive tasks.

method Mixed-integer optimization framework and object-oriented design.

result Implementation of optimal decision trees for various tasks.

decision trees mixed-integer optimization predictive analytics prescriptive analytics fairness

2023-07-28abs ↗pdf ↗