New Approaches for Very Large-Scale Integer Programming

Abstract

The focus of this project is new computational tools for mixed-integer programming (MIP). During the course of this project we have studied and obtained results on the following topics. 1. Dual heuristics for integer programs in order to rapidly improve dual bounds. 2. Choosing good branching variables in branch-and-bound algorithms for MIP. 3. Machine Learning in solving MIPs.4. Parallel Processing in Solving MIPS. The new algorithms are computational tested and, in many cases, outperform existing algorithms. This research has been presented at several conferences and has and will appear in archival journals.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 24, 2016
Accession Number
AD1011273

Entities

People

  • George Nemhauser

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • Air Platforms
  • Autonomy

DTIC Thesaurus Topics

  • Air Force Research Laboratories
  • Algorithms
  • Artificial Intelligence
  • Computer Programming
  • Electronic Mail
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Intellectual Property
  • Linear Programming
  • Machine Learning
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Theses

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Research Science/Academic Research

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms