1973•Mathematical ProgrammingRequires access

Investigation of some branch and bound strategies for the solution of mixed integer linear programs

Gautam Mitra

Open publisher page 90 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 90 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Branch and bound, Branch and price, Integer programming, Branch and cut, Mathematics, Heuristics, Linear programming, Mathematical optimization

Back to paper search Browse research topics Original source

Investigation of some branch and bound strategies for the solution of mixed integer linear programs — Research Paper | ScholarLens