A class of algorithms for mixed-integer bilevel min-max optimization
type: Item
instance of: scholarly article
title: A class of algorithms for mixed-integer bilevel min-max optimization
zbMATH Open document ID: 1380.90197
author: Yen Tang
author: Jean-Philippe Richard
author: J. Cole Smith
published in: Journal of Global Optimization
publication date: 2016-10-25T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 91A65
zbMATH DE Number: 6643060
zbMATH Keywords: bilevel programming
zbMATH Keywords: interdiction problems
zbMATH Keywords: integer programing
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: s10898-015-0274-7
OpenAlex ID: W2062530151
cites work: Finding the most vital arcs in a network
cites work: Q3989989
cites work: Q3160276
cites work: Nonlinear Programming
cites work: Exact solution approach for a class of nonlinear bilevel knapsack problems
cites work: On two-level optimization
cites work: Two-Level Linear Programming
cites work: A dynamic programming algorithm for the bilevel Knapsack problem
cites work: One-level reformulation of the bilevel Knapsack problem using dynamic programming
cites work: A Complexity and Approximability Study of the Bilevel Knapsack Problem
cites work: Most vital links and nodes in weighted networks
cites work: The Theory of Max-Min, with Applications
cites work: Foundations of bilevel programming
cites work: Bilevel programming with knapsack constraints
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: A problem in network interdiction
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Shortest-path network interdiction
cites work: Minimum vertex blocker clique problem
cites work: The k most vital arcs in the shortest path problem
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Finding the n Most Vital Links in Flow Networks
cites work: Discrete linear bilevel programming problem
cites work: Approaches to sensitivity analysis in linear programming
cites work: On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
DOI: 10.1007/S10898-015-0274-7
description: scientific article; zbMATH DE number 6643060