Search Prime Grants

DESC0024834

Project Grant

Overview

Grant Description
Novel branch & bound tree management for fast convergence of MIPS on parallel computers
Funding Goals
N/A
Place of Performance
Bridgewater, New Jersey 08807-2595 United States
Geographic Scope
Single Zip Code
Analysis Notes
Amendment Since initial award the End Date has been extended from 02/11/25 to 04/13/26 and the total obligations have increased 575% from $200,000 to $1,350,000.
Optimal Solutions was awarded Project Grant DESC0024834 worth $1,350,000 from the Office of Science in February 2024 with work to be completed primarily in Bridgewater New Jersey United States. The grant has a duration of 2 years 2 months and was awarded through assistance program 81.049 Office of Science Financial Assistance Program. The Project Grant was awarded through grant opportunity FY 2024 Phase I Release 1.

SBIR Details

Research Type
SBIR Phase I
Title
Novel Branch & Bound Tree Management for Fast Convergence of MIPs on Parallel Computers
Abstract
The need for solving mixed integer programming problems (MIPs) is at the core of millions of decision- support systems running mission-critical applications - especially in large networks and supply chains. Due to the mathematical complexity of solving hard MIPs, many practical problems faced by the industry are routinely left unsolved or solved sub-optimally, resulting in millions of dollars of lost profits and productivity. Managing the ôBranch and Boundö tree and ôbranching variable selectionö is crucial to solving hard MIPs rapidly. This project strives to develop a product to rapidly provide optimal solutions to MIPs that are crucial in areas like biology, transportation, electric grids, and facility infrastructure, which are of interest to DOE. Moreover, we aim to utilize DOEĺs investments in high- performance computing systems, which aligns with the DOE's goals. Our product relies on two key innovations: scalable data storage and manipulation customized for solving MIPs and Machine learning-powered branching variable selection. Inspired by large parallel applications like Facebook and Apple Notes, our approach simplifies distributed data management and enhances branch and bound tree handling across a network of computers. It tackles MIP complexity through parallelization and benefits from data collected during branch and bound processing. Our goal in Phases I and II is to introduce a next-gen mixed integer programming solver, leveraging parallel computing for rapid solving. We will demonstrate feasibility by creating an innovative branch and bound tree management and machine learning-based branching variable selection algorithms and evaluating them on MIPLIB 2017 problem instances. We will use suitable data structures to represent the branch and bound tree, develop code for parallel processing on a distributed computing cluster, and optimize branching variable selection strategies. Our academic and industrial partnerships will be valuable in this effort. The planned commercial application will aid quick decision-making in supply chains, leading to improved service quality and safer products. Companies are expected to save millions of dollars annually through enhanced customer service, reduced supply chain costs, and a smaller environmental footprint.
Topic Code
C57-06a
Solicitation Number
DE-FOA-0003110

Status
(Ongoing)

Last Modified 9/23/25

Period of Performance
2/12/24
Start Date
4/13/26
End Date
76.0% Complete

Funding Split
$1.4M
Federal Obligation
$0.0
Non-Federal Obligation
$1.4M
Total Obligated
100.0% Federal Funding
0.0% Non-Federal Funding

Activity Timeline

Interactive chart of timeline of amendments to DESC0024834

Transaction History

Modifications to DESC0024834

Additional Detail

Award ID FAIN
DESC0024834
SAI Number
None
Award ID URI
SAI EXEMPT
Awardee Classifications
Small Business
Awarding Office
892430 SC CHICAGO SERVICE CENTER
Funding Office
892401 SCIENCE
Awardee UEI
MNRUWLRAW7T6
Awardee CAGE
6HRG2
Performance District
NJ-07
Senators
Robert Menendez
Cory Booker
Modified: 9/23/25