An enhanced branch-and-bound algorithm for bilevel integer linear programming
type: Item
instance of: scholarly article
title: An enhanced branch-and-bound algorithm for bilevel integer linear programming
zbMATH Open document ID: 1487.90482
author: Shaonan Liu
author: Nan Kong
author: Xiangpei Hu
author: Ming-Zheng Wang
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7356153
zbMATH Keywords: integer programming
zbMATH Keywords: bilevel programming
zbMATH Keywords: branch and bound
zbMATH Keywords: enhanced branching
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.10.002
OpenAlex ID: W3091951114
cites work: Q3989989
cites work: A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
cites work: Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
cites work: Bilevel Knapsack with Interdiction Constraints
cites work: Enhanced exact algorithms for discrete bilevel linear problems
cites work: A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
cites work: Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
cites work: Natural gas bilevel cash-out problem: convergence of a penalty function method
cites work: Discrete bilevel programming: application to a natural gas cash-out problem
cites work: Necessary optimality conditions in pessimistic bilevel programming
cites work: Parametric global optimisation for bilevel programming
cites work: Intersection Cuts for Bilevel Optimization
cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
cites work: On the use of intersection cuts for bilevel optimization
cites work: Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
cites work: A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
cites work: The polynomial hierarchy and a simple model for competitive analysis
cites work: A linearization approach to solve the natural gas cash-out bilevel problem
cites work: A natural gas cash-out problem: a bilevel programming framework and a penalty function method
cites work: A bilevel model of taxation and its application to optimal highway pricing
cites work: A Backward Sampling Framework for Interdiction Problems with Fortification
cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
cites work: Uniqueness of solution in linear programming
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique
cites work: A class of algorithms for mixed-integer bilevel min-max optimization
cites work: Discrete linear bilevel programming problem
cites work: The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
cites work: Pessimistic Bilevel Optimization
cites work: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
cites work: A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
cites work: A note on linearized reformulations for a class of bilevel linear integer problems
DOI: 10.1016/J.EJOR.2020.10.002
description: scientific article; zbMATH DE number 7356153