Bilevel programming and the separation problem
From MaRDI portal
(Redirected from Publication:403662)
Recommendations
Cites work
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel programming: a survey
- Chvátal closures for mixed integer programming problems
- Column Generation
- Disjunctive Programming
- Easy and difficult objective functions for max cut
- On the MIR Closure of Polyhedra
- On the separation of disjunctive cuts
- On the separation of split cuts and related inequalities
- Optimizing over the split closure
- Polyhedral study of the capacitated vehicle routing problem
- Separating tight metric inequalities by bilevel programming
- The Mixed Integer Linear Bilevel Programming Problem
- The complexity of satisfiability problems
- The ellipsoid method and its consequences in combinatorial optimization
- The polynomial hierarchy and a simple model for competitive analysis
- The polynomial-time hierarchy
- The traveling salesman problem. A computational study.
- The truck dispatching problem
Cited in
(26)- On the use of intersection cuts for bilevel optimization
- An exact method for binary fortification games
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- A dynamic reformulation heuristic for generalized interdiction problems
- scientific article; zbMATH DE number 1146101 (Why is no real title available?)
- MIPping closures: An instant survey
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- On bilevel programming and its impact in branching, cutting and complexity. (Abstract)
- 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 representability
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- Separating tight metric inequalities by bilevel programming
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Solving Quadratic Programming by Cutting Planes
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- A survey on mixed-integer programming techniques in bilevel optimization
- Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
- Algorithms and applications for a class of bilevel MILPs
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions
- Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete
- Rejection-proof mechanisms for multi-agent kidney exchange
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Multistage bilevel programming problems
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Global optimization of multilevel electricity market models including network design and graph partitioning
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)
