Enhanced exact algorithms for discrete bilevel linear problems

DOI10.1007/s11590-015-0872-9zbMath1332.90170OpenAlexW2054847117MaRDI QIDQ499703

Renato Mari, Massimiliano Caramia

Publication date: 6 October 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0872-9

zbMATH Keywords

branch and cutcutting planesexact methodsbilevel linear programmingdiscrete bilevel linear problems

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (24)

Intersection Cuts for Bilevel Optimization ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ Benders Subproblem Decomposition for Bilevel Problems with Convex Follower ⋮ The leader multipurpose shopping location problem ⋮ On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty ⋮ An exact solution algorithm for integer bilevel programming with application in energy market optimization ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ On Bilevel Optimization with Inexact Follower ⋮ Mixed-integer bilevel representability ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities ⋮ On a class of bilevel linear mixed-integer programs in adversarial settings ⋮ A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ On the use of intersection cuts for bilevel optimization ⋮ An exact algorithm for solving the bilevel facility interdiction and fortification problem ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem ⋮ Multilevel Approaches for the Critical Node Problem ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A simple tabu search method to solve the mixed-integer linear bilevel programming problem
• Practical bilevel optimization. Algorithms and applications
• Links between linear bilevel and mixed 0-1 programming problems
• Foundations of bilevel programming
• Algorithms for solving the mixed integer two-level linear programming problem
• Discrete linear bilevel programming problem
• An exact algorithm for bilevel 0-1 knapsack problems
• Disjunctive cuts for continuous linear bilevel programming
• New branch-and-Cut algorithm for bilevel linear programming
• An overview of bilevel optimization
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• The polynomial hierarchy and a simple model for competitive analysis
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• On two-level optimization
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem

This page was built for publication: Enhanced exact algorithms for discrete bilevel linear problems