A note on linearized reformulations for a class of bilevel linear integer problems
type: Item
instance of: scholarly article
title: A note on linearized reformulations for a class of bilevel linear integer problems
zbMATH Open document ID: 1411.90228
author: M. Hosein Zare
author: Juan S. Borrero
author: Bo Zeng
author: Oleg A. Prokopyev
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7032638
zbMATH Keywords: bilevel optimization
zbMATH Keywords: bilevel integer programming
zbMATH Keywords: mixed integer linear programming
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10479-017-2694-x
OpenAlex ID: W2770478654
cites work: Linear forms of nonlinear expressions: new insights on old ideas
cites work: Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
cites work: Links between linear bilevel and mixed 0-1 programming problems
cites work: New branch-and-Cut algorithm for bilevel linear programming
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: Exact solution approaches for bilevel assignment problems
cites work: Two-Level Linear Programming
cites work: A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
cites work: A note on a modified simplex approach for solving bilevel linear programming problems
cites work: Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
cites work: A Complexity and Approximability Study of the Bilevel Knapsack Problem
cites work: Bilevel programming: a survey
cites work: An overview of bilevel optimization
cites work: Finding the n Most Vital Nodes in a Flow Network
cites work: Foundations of bilevel programming
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: An integer linear programming approach for bilinear integer programming
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: Solving mixed integer bilinear problems using MILP formulations
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: The polynomial hierarchy and a simple model for competitive analysis
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Multilevel optimization: algorithms and applications
cites work: An improved linearization strategy for zero-one quadratic programming problems
cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
cites work: A note on a global approach for general 0-1 fractional programming
cites work: Matching interdiction
DOI: 10.1007/S10479-017-2694-X
description: scientific article; zbMATH DE number 7032638