Results 121 to 130 of about 16,981 (186)
MILP-aided Cryptanalysis of Round Reduced ChaCha [PDF]
The inclusion of ChaCha20 and Poly1305 into the list of supported ciphers in TLS 1.3 necessitates a security evaluation of those ciphers with all the state-of-the-art tools and innovative cryptanalysis methodologies.
Najwa Aaraj +2 more
core +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
On‐Time Meal Delivery Assisted by Drone Resupply
ABSTRACT Ensuring timely delivery is crucial with the increasing competition in online meal delivery services. This requires the industry to adopt new technologies and the corresponding operational models, including the use of drones. Concerning the desired features of meal delivery, such as safety and reliability, we propose an operational model that ...
Wenqian Liu, Lindong Liu, Xiangtong Qi
wiley +1 more source
Optimizing Household Waste Recycling Centre Network Reorganization in Hampshire
ABSTRACT Local councils across the UK are facing sustained financial pressures, and Household Waste Recycling Centres (HWRCs) are being increasingly considered for closure to reduce expenditure. In 2024, Hampshire County Council, which operates the largest HWRC network in the UK, proposed closing either five or twelve existing sites.
Montree Jaidee +4 more
wiley +1 more source
Research on real-time optimization behavior of AUV based on MILP
针对自主水下机器人(Autonomous Underwater Vehicles,AUV)复杂动态环境下的实时局部路径规划的问题,采用了在全局坐标系下基于混合整数线性规划(Mixed Integer Linear Programming,MILP)的最优轨迹产生方法。在全局坐标系下,把复杂动态环境下AUV路径规划这一非线性问题,描述成满足一组线性约束同时使目标函数极小的线性规划问题,嵌入基于MILP的规划器,从而得到一条满足性能要求的最优路径。该方法充分考虑了障碍物、目标、本体动力学以及传感器的约束 ...
刘开周, 程大军
core
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli +2 more
wiley +1 more source
Optimizing the energy consumption of three-dimensional wireless sensor networks (3D-WSNs) is significantly more difficult than optimizing that of two-dimensional WSNs.
Jehad I. Ababneh +2 more
doaj +1 more source
This paper is proposed to demonstrate the implementation of Mixed-Integer Linear Programming (MILP) for solving the optimal operation of the Integrated Electricity and Natural Gas System (IENGS).
Ervina Nooraini +4 more
doaj +1 more source
Energy Optimization Models for the Locomotive Assignment Problem
ABSTRACT Reducing energy consumption is a key objective in transportation. Using detailed infrastructure data, this study introduces the Green Locomotive Assignment Problem (GLAP) to minimize energy consumption in railway operations by efficiently assigning locomotives to pre‐scheduled trains.
Gislind Baumgartner +3 more
wiley +1 more source
The robust Mixed-Integer Linear Programming (MILP) model is an approach to address uncertainty in linear optimization involving integer and continuous variables, which can be solved using the Benders Decomposition method.
Fadiah Hasna Nadiatul Haq +2 more
doaj +1 more source

