An extended branch and bound algorithm for linear bilevel programming
type: Item
instance of: scholarly article
title: An extended branch and bound algorithm for linear bilevel programming
zbMATH Open document ID: 1102.65071
author: Chenggen Shi
author: Jie Lü
author: Hong Zhou
author: Guangquan Zhang
published in: Applied Mathematics and Computation
publication date: 2006-10-31T00:00:00Z
full work available at URL: shi-extendedbranch
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5069168
zbMATH Keywords: optimization
zbMATH Keywords: von Stackelberg game
zbMATH Keywords: numerical examples
MaRDI profile type: Publication
OpenAlex ID: W2035726060
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Two-Level Linear Programming
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: A penalty function approach for solving bi-level linear programs
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: On the definition of linear bilevel programming solution
cites work: An extended \(K\)th-best approach for linear bilevel programming
cites work: An extended Kuhn-Tucker approach for linear bilevel programming
DOI: 10.1016/J.AMC.2005.12.039
description: scientific article; zbMATH DE number 5069168