Výsledky vyhľadávania - "Exact algorithm"

An improved algorithm exploiting the characteristics of a distance-based preference function to converge to preferred solutions Autor Karakaya, G., Köksalan, M.

“…We address the problem of choosing the most preferred of a set of alternatives that are defined by multiple criteria. We assume that the decision maker’s…”
Získať plný text

Recent Advances in Knapsack Problem: A Comprehensive Review of Models, Algorithms, and Applications Autor Feng, Yanhong, Hu, Tianyu, Chen, Xin-Ao, Wang, Gai-Ge

Získať plný text

An efficient algorithm for isometrically embedding weighted trees into low-dimensional ℓ ∞ -normed spaces Autor Queiroz, Jonathan, Januario, Tiago

Získať plný text

Provably Efficient Service Function Chain Embedding and Protection in Edge Networks Autor Zheng, Danyang, Cao, Xiaojun

“…Internet-connected devices generate service function chain (SFC) requests for reliability-sensitive applications such as smart factories and intelligent…”
Získať plný text

An exact approach for the two-dimensional strip packing problem with defects Autor Yao, Shaowen, Zhang, Hao, Wei, Lijun, Liu, Qiang

“…The paper studies the two-dimensional strip packing problem with defects (2DSPP_D), focusing on packing rectangular items orthogonally within a fixed-width,…”
Získať plný text

Set cover, hitting set, and independent set problems for some restricted classes of geometric objects Autor De, Minati, Mandal, Ratnadip, Nandy, Subhas C.

“…We consider the well-known set cover, hitting set, and independent set problems for some restricted classes of geometric objects. We present an 8-approximation…”
Získať plný text

Exact algorithms for maximum independent set Autor Xiao, Mingyu, Nagamochi, Hiroshi

“…We show that the maximum independent set problem on an n-vertex graph can be solved in 1.1996nnO(1) time and polynomial space, which even is faster than…”
Získať plný text

EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints Autor Wang, Sunkanghong, Baldacci, Roberto, Liu, Qiang, Wei, Lijun

“…This paper addresses the Two-Dimensional Knapsack Problem with Guillotine Constraints, which is a famous NP-hard problem and is commonly encountered in…”
Získať plný text

Ensemble of Metaheuristic and Exact Algorithm Based on the Divide-and-Conquer Framework for Multisatellite Observation Scheduling Autor Wu, Guohua, Luo, Qizhang, Du, Xiao, Chen, Yingguo, Suganthan, Ponnuthurai Nagaratnam, Wang, Xinwei

“…Satellite observation scheduling plays a significant role in improving the efficiency of Earth observation systems. To solve the large-scale multisatellite…”
Získať plný text

An exact algorithm for the Euclidean k-Steiner tree problem Autor Brazil, Marcus, Hendriksen, Michael, Lee, Jae, Payne, Michael S., Ras, Charl, Thomas, Doreen

“…The Euclidean k-Steiner tree problem asks for a minimum-cost network connecting n given points in the plane, allowing at most k additional nodes referred to as…”
Získať plný text

Optimization of machine schedules and vehicle routes in the mobile additive manufacturing mode Autor Yuan, Biao, Cui, Weiwei

Získať plný text

A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects Autor Yao, Shaowen, Wang, Sunkanghong, Zhang, Tai, Wei, Lijun, Liu, Qiang

Získať plný text

Complexity of computing the anti-Ramsey numbers for paths Autor Akhoondian Amiri, Saeed, Popa, Alexandru, Roghani, Mohammad, Shahkarami, Golnoosh, Soltani, Reza, Vahidi, Hossein

“…The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erdős, Simonovits and Sós. For given graphs G and H the anti-Ramsey…”
Získať plný text

Assembly line balancing problem with ergonomics: a new fatigue and recovery model Autor Abdous, Mohammed-Amine, Delorme, Xavier, Battini, Daria, Sgarbossa, Fabio, Berger-Douce, Sandrine

“…Assembly lines are production lines used to manufacture products, ranging from mass-production products to mass-customisation with low unit products. Assembly…”
Získať plný text

Finding and exploring promising search space for The 0–1 Multidimensional Knapsack Problem Autor Xu, Jitao, Li, Hongbo, Yin, Minghao

“…The 0–1, Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem with many engineering applications. In this paper,…”
Získať plný text

A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times Autor Liu, Ying, Jin, Shuang, Zhou, Jing, Hu, Qian

“…We study a project scheduling problem where unit-capacity resources and transfer times are involved, and propose a branch-and-bound algorithm to solve it. In…”
Získať plný text

Solving the strip packing problem with a decomposition framework and a generic solver: Implementation, tuning, and reinforcement-learning-based hybridization Autor Akçay, Fatih Burak, Delorme, Maxence

“…In the strip packing problem, the objective is to pack a set of two-dimensional items into a strip of fixed width such that the total height of the packing is…”
Získať plný text

An exact algorithm for RAP with k-out-of-n subsystems and heterogeneous components under mixed and K-mixed redundancy strategies Autor Li, Jiangang, Wang, Dan, Yang, Haoxiang, Liu, Mingli, Si, Shubin

“…Redundancy design is a widely used technique for enhancing system reliability across various industries, including aerospace and manufacturing. Consequently,…”
Získať plný text

The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability Autor Mkrtchyan, Vahan

Získať plný text

A cut-and-solve algorithm for virtual machine consolidation problem Autor Luo, Jiang-Yao, Chen, Liang, Chen, Wei-Kun, Yuan, Jian-Hua, Dai, Yu-Hong

“…The virtual machine consolidation problem attempts to determine which servers to be activated, how to allocate virtual machines to the activated servers, and…”
Získať plný text