COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
From MaRDI portal
Publication:4781285
DOI10.1080/019697200124892zbMath1030.90061OpenAlexW2106467356MaRDI QIDQ4781285
Ichiro Nishizaki, Masatoshi Sakawa
Publication date: 21 January 2003
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/019697200124892
Related Items (10)
Stackelberg solutions for fuzzy random bilevel linear programming through level sets and probability maximization ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Interactive fuzzy random two-level linear programming through fractile criterion optimization ⋮ Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility ⋮ Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization ⋮ Interactive random fuzzy two-level programming through possibility-based probability model ⋮ Interactive fuzzy random two-level linear programming based on level sets and fractile criterion optimization ⋮ Interactive fuzzy stochastic two-level linear programming with simple recourse ⋮ COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
This page was built for publication: COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
