z-logo
open-access-imgOpen Access
A simplex-based branch-and-cut method for solving integer tri-level programming problems
Author(s) -
Ashenafi Awraris,
Berhanu Wordofa,
Semu Mitiku Kassa
Publication year - 2021
Publication title -
journal of mathematics and computer science
Language(s) - English
Resource type - Journals
ISSN - 2008-949X
DOI - 10.22436/jmcs.025.03.03
Subject(s) - branch and cut , integer programming , branch and price , simplex , simplex algorithm , integer (computer science) , mathematical optimization , branch and bound , mathematics , computer science , linear programming , combinatorics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom