|
|
|
|
|
Slim Belhaiza
When several Nash equilibria exist in the game, decision-makers need to refine their choices based on some refinement concepts. To this aim, the notion of a ??
?
-proper equilibria set for polymatrix games is used to develop 0?1 mixed linear programs and...
ver más
|
|
|
|
|
|
|
|
|
Kaan Yilmaz and Neil Yorke-Smith
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming (MIP) branch-and-bound tree by using a learned policy. Previous...
ver más
|
|
|
|
|
|
|
|
|
Chandra Agung, Natalia Christine
Pág. 69 - 75
The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem...
ver más
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer...
ver más
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 6 - 10
The paper presents a new method for solving the 0?1 linear programming problems (LPs). The general 0?1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes an...
ver más
|
|
|
|