|
|
|
|
|
Zhiqiang Niu, Shengnan Wu and Xuesong (Simon) Zhou
Focusing on the dynamic improvement of the underlying service network configuration, this paper aims to address a specific challenge of redesigning a multi-echelon city logistics distribution network. By considering the intra-echelon connection of facili...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo, Joshua Chukwuere and Trust Tawanda
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal int...
ver más
|
|
|
|
|
|
|
|
|
|
|
Feihu Zhang, Diandian Xu and Chensheng Cheng
Multi-vehicle collaborative mapping proves more efficient in constructing maps in unfamiliar underwater environments in comparison to single-vehicle methods. One of the pivotal hurdles of Simultaneous Localization and Mapping (SLAM) with multiple underwa...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wenhao Ma and Hongzhen Xu
Cloud computing has experienced rapid growth in recent years and has become a critical computing paradigm. Combining multiple cloud services to satisfy complex user requirements has become a research hotspot in cloud computing. Service composition in mul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patcharin Buayen and Jeeraporn Werapun
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Jinjin Yan, Sisi Zlatanova, Jinwoo (Brian) Lee and Qingxiang Liu
With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance o...
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
|
|
|
|
|
|