☆ 4.4 Article

A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

MATHEMATICAL PROGRAMMING COMPUTATION (2020)

Rate this paper

The primary rating indicates the level of overall quality for the paper. Secondary ratings independently reflect strengths or weaknesses of the paper.

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

Rate this paper

Find Funding. Review Successful Grants.

Discover Peeref hubs

Export Citation

Share Paper