1997•Journal of Optimization Theory and ApplicationsRequires access

Links Between Linear Bilevel and Mixed 0–1 Programming Problems

Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard

Open publisher page 148 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 148 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: Bilevel optimization, Linear programming, Theory of computation, Mathematics, Mathematical optimization, Branch and bound, Algorithm, Optimization problem

Back to paper search Browse research topics Original source

Links Between Linear Bilevel and Mixed 0–1 Programming Problems — Research Paper | ScholarLens