Bilevel programming and the separation problem

DOI10.1007/s10107-013-0700-xzbMath1401.90128OpenAlexW2162467101MaRDI QIDQ403662

Ted K. Ralphs, Andrea Lodi, Gerhard J. Woeginger

Publication date: 29 August 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0700-x

zbMATH Keywords

computational complexitycutting planesseparationbilevel programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, A survey on mixed-integer programming techniques in bilevel optimization, Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete, An exact method for binary fortification games, Rejection-proof mechanisms for multi-agent kidney exchange, An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Mixed-integer bilevel representability, Solving Quadratic Programming by Cutting Planes, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, A dynamic reformulation heuristic for generalized interdiction problems, Global optimization of multilevel electricity market models including network design and graph partitioning, Algorithms and applications for a class of bilevel MILPs, On the use of intersection cuts for bilevel optimization, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• Concorde

Cites Work

• Unnamed Item
• On the separation of disjunctive cuts
• Polyhedral study of the capacitated vehicle routing problem
• Bilevel programming: a survey
• Chvátal closures for mixed integer programming problems
• The ellipsoid method and its consequences in combinatorial optimization
• The polynomial-time hierarchy
• On the separation of split cuts and related inequalities
• Easy and difficult objective functions for max cut
• Separating tight metric inequalities by bilevel programming
• Optimizing over the split closure
• The Truck Dispatching Problem
• The polynomial hierarchy and a simple model for competitive analysis
• Disjunctive Programming
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The Mixed Integer Linear Bilevel Programming Problem
• Column Generation
• The complexity of satisfiability problems
• On the MIR Closure of Polyhedra