Search Results - Partial inverse mixed integer linear programming

Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem by Wang, Lizhi

“…This paper presents branch-and-bound algorithms for the partial inverse mixed integer linear programming (PInvMILP…”
Get full text

Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased by Ley, Eva, Merkert, Maximilian

“…Partial inverse combinatorial optimization problems are bilevel optimization problems in which the leader aims to incentivize the follower to include respectively not include given sets of elements…”
Get full text

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming by Zhu, Jianshen, Azam, Naveed Ahmed, Zhang, Fan, Shurbevski, Aleksandar, Haraguchi, Kazuya, Zhao, Liang, Nagamochi, Hiroshi, Akutsu, Tatsuya

“…) and mixed integer linear programming (MILP). This method consists of a prediction phase and an inverse prediction phase…”
Get full text

Advances and Novel Approaches in Discrete Optimization

“… Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems…”
Get full text

Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased: Solution methods for partial inverse combinatorial by Ley, Eva, Merkert, Maximilian

“…Partial inverse combinatorial optimization problems are bilevel optimization problems in which the leader aims to incentivize the follower to include respectively not include given sets of elements…”
Get full text

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming by Akutsu, Tatsuya, Nagamochi, Hiroshi

“…) and mixed integer linear programming (MILP). This method consists of a prediction phase and an inverse prediction phase…”
Get full text

A LAGRANGEAN RELAXATION APPROACH TO THE GENERALIZED FIXED CHARGE MULTICOMMODITY MINIMAL COST NETWORK FLOW PROBLEM by HELGASON, RICHARD VERNON

“… for the continuous relaxation and mixed integer subproblem itself. Further, it is shown that for these subproblems the optimal objective value for the partial convex hull…”
Get full text