Log In Sign Up

DiversiTree: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems

by   Izuwa Ahanor, et al.

While most methods for solving mixed-integer optimization problems compute a single optimal solution, a diverse set of near-optimal solutions can often be more useful. We present a new method for finding a set of diverse solutions by emphasizing diversity within the search for near-optimal solutions. Specifically, within a branch-and-bound framework, we investigate parameterized node selection rules that explicitly consider diversity. Our results indicate that our approach significantly increases diversity of the final solution set. When compared with two existing methods, our method runs with similar runtime as regular node selection methods and gives a diversity improvement of up to 140 an improvement in diversity of no more than 40 method is most effective when diversity in node selection is continuously emphasized after reaching a minimal depth in the tree and when the solution set has grown sufficiently large. Our method can be easily incorporated into integer programming solvers and has the potential to significantly increase diversity of solution sets.


page 1

page 2

page 3

page 4


Mixed Integer Neural Inverse Design

In computational design and fabrication, neural networks are becoming im...

A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementation

In this paper, we describe a comprehensive algorithmic framework for sol...

Learning Efficient Search Approximation in Mixed Integer Branch and Bound

In line with the growing trend of using machine learning to improve solv...

A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs

We propose a novel approach using supervised learning to obtain near-opt...

Diversity in Kemeny Rank Aggregation: A Parameterized Approach

In its most traditional setting, the main concern of optimization theory...

MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers

Mixed-integer programming (MIP) technology offers a generic way of formu...

Neural Networked Assisted Tree Search for the Personnel Rostering Problem

The personnel rostering problem is the problem of finding an optimal way...