Branch-and-cut solution approach for multilevel mixed integer linear programming problems

DOI10.1016/J.EJCO.2023.100076MaRDI QIDQ6491343zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1016/J.EJCO.2023.100076

zbMATH Keywords

branch-and-cutmixed integer programmingvalid inequalitiesmultilevel optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
• Multi-level integer programming problem with multiple objectives at each level
• A global optimization algorithm for solving linear multilevel programming problem
• A solution approach for multi-level integer indefinite quadratic programming problems
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs

Cites work

• A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A relaxation solving approach for the linear trilevel programming problem
• A solution to bi/tri-level programming problems using particle swarm optimization
• A tri-level optimization model for a private road competition problem with traffic equilibrium constraints
• A trilevel programming approach for electric grid defense planning
• An Automatic Method of Solving Discrete Programming Problems
• An investigation of the linear three level programming problem
• Bilevel knapsack with interdiction constraints
• Branching rules revisited
• Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
• Discrete linear bilevel programming problem
• Improving strong branching by domain propagation
• Integer programming and convex analysis: Intersection cuts from outer polars
• Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms
• Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming
• Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
• On the numerical solution of a class of Stackelberg problems
• On the use of intersection cuts for bilevel optimization
• Penalty function approach to linear trilevel programming
• Robust bi-level optimization of relief logistics operations
• Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
• The Mixed Integer Linear Bilevel Programming Problem
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• The hybrid algorithm for solving the three-level linear programming problem
• The polynomial hierarchy and a simple model for competitive analysis
• Three-level global resource allocation model for HIV control: a hierarchical decision system approach

This page was built for publication: Branch-and-cut solution approach for multilevel mixed integer linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491343)