Branch-and-cut solution approach for multilevel mixed integer linear programming problems
From MaRDI portal
Publication:6491343
DOI10.1016/J.EJCO.2023.100076MaRDI QIDQ6491343
Ashenafi Awraris, Berhanu Guta Wordofa, Semu Mitiku Kassa
Publication date: 24 April 2024
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Cites Work
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
- A trilevel programming approach for electric grid defense planning
- Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
- A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
- The hybrid algorithm for solving the three-level linear programming problem
- Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms
- Penalty function approach to linear trilevel programming
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- On the use of intersection cuts for bilevel optimization
- Branching rules revisited
- Discrete linear bilevel programming problem
- A tri-level optimization model for a private road competition problem with traffic equilibrium constraints
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A relaxation solving approach for the linear trilevel programming problem
- Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming
- A solution to bi/tri-level programming problems using particle swarm optimization
- Robust bi-level optimization of relief logistics operations
- Three-level global resource allocation model for HIV control: a hierarchical decision system approach
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- Improving strong branching by domain propagation
- Bilevel Knapsack with Interdiction Constraints
- On the numerical solution of a class of Stackelberg problems
- An Automatic Method of Solving Discrete Programming Problems
- An investigation of the linear three level programming problem
- The polynomial hierarchy and a simple model for competitive analysis
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- The Mixed Integer Linear Bilevel Programming Problem
- Integer programming and convex analysis: Intersection cuts from outer polars
This page was built for publication: Branch-and-cut solution approach for multilevel mixed integer linear programming problems