An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. For achieving this purpose, a historical perspective of the development of enumeration methods in the field of bi-level linear programming is considered. Then, we present some obstacles for using branch...
Main Authors: | Arsalan Rahmani, Majid Yousefikhoshbakht |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitat Politecnica de Valencia
2017-01-01
|
Series: | International Journal of Production Management and Engineering |
Subjects: | |
Online Access: | http://polipapers.upv.es/index.php/IJPME/article/view/6512 |
Similar Items
-
New Hybrid Cutting Plane Method For Solving Integer Linear Programming Problems
by: Abbas Al-Bayati, et al.
Published: (2011-07-01) -
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
by: SINGHAL, JAYA ASTHANA.
Published: (1982) -
[en] A NEW BRANCH-AND-CUT ALGORITHM FOR THE GENERALIZED LEAST COST INFLUENCE PROBLEM IN NETWORKS
Published: (2020) -
Relaxation and decomposition methods for mixed integer nonlinear programming
by: Nowak, Ivo
Published: (2005) -
Cutting Planes for Large Mixed Integer Programming Models
by: Goycoolea, Marcos G.
Published: (2007)