A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS
best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example
For authors and organisers
Find the right journal for your paper and submit your manuscript.