Bilevel programming and the separation problem
DOI10.1007/S10107-013-0700-XzbMATH Open1401.90128OpenAlexW2162467101MaRDI QIDQ403662FDOQ403662
Authors: Andrea Lodi, Ted K. Ralphs, 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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- The traveling salesman problem. A computational study.
- The polynomial hierarchy and a simple model for competitive analysis
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- The ellipsoid method and its consequences in combinatorial optimization
- The truck dispatching problem
- The complexity of satisfiability problems
- Disjunctive Programming
- The polynomial-time hierarchy
- Column Generation
- Easy and difficult objective functions for max cut
- The Mixed Integer Linear Bilevel Programming Problem
- Optimizing over the split closure
- Chvátal closures for mixed integer programming problems
- Separating tight metric inequalities by bilevel programming
- Bilevel programming: a survey
- On the separation of split cuts and related inequalities
- On the MIR Closure of Polyhedra
- On the separation of disjunctive cuts
- Polyhedral study of the capacitated vehicle routing problem
Cited In (25)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Algorithms and applications for a class of bilevel MILPs
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- An exact method for binary fortification games
- Multistage bilevel programming problems
- Global optimization of multilevel electricity market models including network design and graph partitioning
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- MIPping closures: An instant survey
- On bilevel programming and its impact in branching, cutting and complexity. (Abstract)
- Solving Quadratic Programming by Cutting Planes
- Rejection-proof mechanisms for multi-agent kidney exchange
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- A survey on mixed-integer programming techniques in bilevel optimization
- Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
- On the use of intersection cuts for bilevel optimization
- Mixed-integer bilevel representability
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
- A dynamic reformulation heuristic for generalized interdiction problems
- Separating tight metric inequalities by bilevel programming
- An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete
- Title not available (Why is that?)
Uses Software
This page was built for publication: Bilevel programming and the separation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403662)
