New Branch-and-Bound Rules for Linear Bilevel Programming
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Solving bilevel linear programs using multiple objective linear programming
- A genetic algorithm for solving linear fractional bilevel problems
- New operations research and artificial intelligence approaches to traffic engineering problems
- On the quasiconcave bilevel programming problem
- A quasiconcave minimization method for solving linear two-level programs
- Descent approaches for quadratic bilevel programming
- Bilevel and multilevel programming: A bibliography review
- The steepest descent direction for the nonlinear bilevel programming problem
- A multilevel analysis of agricultural credit distribution in East Java, Indonesia
- Links between linear bilevel and mixed 0-1 programming problems
- Pure competition, regulated and Stackelberg equilibria: Application to the energy system of Québec
- A bilevel programming approach to determining tax credits for biofuel production
- A new descent algorithm for solving quadratic bilevel programming problems.
- A partial cooperation model for non-unique linear two-level decision problems
- A trust region algorithm for nonlinear bilevel programming
- Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
- Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function
- Integrated recycling-integrated production-distribution planning for decentralized closed-loop supply chain
- A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems
- A note on linearized reformulations for a class of bilevel linear integer problems
- Feature selection for classification models via bilevel optimization
- Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping
- A dynamic reformulation heuristic for generalized interdiction problems
- On a class of bilevel linear mixed-integer programs in adversarial settings
- An extended Kuhn-Tucker approach for linear bilevel programming
- On the definition of linear bilevel programming solution
- Discrete bilevel programming: application to a natural gas cash-out problem
- A study of local solutions in linear bilevel programming
- Determining optimal pollution control policies: An application of bilevel programming
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Fuzzy multiple level programming
- Bilevel programming in traffic planning: Models, methods and challenge
- Discrete linear bilevel programming problem
- Algorithms for linear programming with linear complementarity constraints
- Linear bilevel programming solution by genetic algorithm
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- A stone resource assignment model under the fuzzy environment
- A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- Stochastic mathematical programs with equilibrium constraints
- On topology optimization and canonical duality method
- An effective bilevel programming approach for the evasive flow capturing location problem
- Global optimization of multilevel electricity market models including network design and graph partitioning
- Bi-level vendor-buyer strategies for a time-varying product price
- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- Which efficient solution in multi objective programming problem should be taken?
- A robust approach for modeling limited observability in bilevel optimization
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- Global optimization for the multilevel European gas market system with nonlinear flow models on trees
- An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective
- Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Adjustable robust optimization through multi-parametric programming
- Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework
- Pseudo-feasible solutions in evolutionary bilevel optimization: test problems and performance assessment
- Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Solving linear programs with complementarity constraints using branch-and-cut
- A solution to bi/tri-level programming problems using particle swarm optimization
- Robust bi-level optimization of relief logistics operations
- A Stackelberg knapsack game with weight control
- Competitive location in cognitive radio networks
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- The Kth-best approach for linear bilevel multifollower programming with partial shared variables among followers
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- A bilevel mixed-integer program for critical infrastructure protection planning
- Disjunctive cuts for continuous linear bilevel programming
- A novel approach to bilevel nonlinear programming
- Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation
- Parametric global optimisation for bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- An exact solution approach for the interdiction median problem with fortification
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A new method for strong-weak linear bilevel programming problem
- Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- The eigenvalue complementarity problem
- Stackelberg population dynamics: a predictive-sensitivity approach
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
- A study on the use of heuristics to solve a bilevel programming problem
- Multilevel optimization modeling for risk-averse stochastic programming
- A cutting plane approach for solving linear bilevel programming problems
- An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
- A pivoting algorithm for linear programming with linear complementarity constraints
- Lagrangean relaxation-based algorithm for bi-level problems
This page was built for publication: New Branch-and-Bound Rules for Linear Bilevel Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021697)
