Search · four archives
Search · four archives
13 papers · ranked by Valyu relevance
Xuelei Meng, Bingmou Cui
Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This paper focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost…
Marcel-Ioan Boloș, Ioana-Alexandra Bradea, Camelia Delcea
This paper studies the problem of tangible assets acquisition within the company by proposing a new hybrid model that uses linear programming and fuzzy numbers. Regarding linear programming, two methods were implemented in the model, namely: the graphical method and the primal simplex algorithm. This hybrid model is…
Seyyed Ahmad Edalatpanah, Massimiliano Fasi
There are several approaches to address fuzzy linear programming problems (FLPP). However, due to using standard interval arithmetic (SIA), these methods have some limitations and are not complete solutions. This article establishes a new approach to fuzzy linear programming via the theory of horizontal membership…
Krzysztof Kaczmarek, Ludmila Dymova, Pavel Sevastjanov
In this paper, a new method for the solution of distribution problem in a fuzzy setting is presented. It consists of two phases. In the first of them, the problem is formulated as the classical, fully fuzzy transportation problem. A new, straightforward numerical method for solving this problem is proposed. This method…
Chongfeng Ren, Jiantao Yang, Hongbo Zhang, Baogui Xin
In reality, severe water shortage crisis has made bad impact on the sustainable development of a region. In addition, uncertainties are inevitable in the irrigation system. Therefore, a fully fuzzy fractional programming model for optimization allocation of irrigation water resources, which aimed at not only irrigation…
S. Narayanamoorthy, S. Kalyani
An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by…
Reza Kargar, Tofigh Allahviranloo, Mohsen Rostami-Malkhalifeh, Gholam Reza Jahanshaloo
'Gholam Reza Jahanshaloo'] This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m × n linear system are derived and also a practical algorithm is introduced…
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
Approximate integer programming is the following: For a given convex body $K \subseteq{\mathbb{R}}^n$, either determine whether $K \cap{\mathbb{Z}}^n$ is empty, or find an integer point in the convex body $2\cdot K - c +c$ which is K, scaled by 2 from its center of gravity c. Approximate integer programming can be…
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
A rational number is dyadic if it has a finite binary representation $p/2^k$, where p is an integer and k is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-point arithmetic on a computer. A vector is dyadic if all its entries are…
Gennadiy Averkov, Matthias Schymura
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity ${{\,\mathrm{rc}\,}}X$. This parameter, introduced by Kaibel & Weltge (2015), captures the complexity of linear descriptions of X without using…
Ritchie Lee, Susmit Jha, Anastasia Mavridou, Dimitra Giannakopoulou + 4 more
'Ralph Bottesch' 'Max W. Haslbeck' 'Alban Reynaud' 'René Thiemann'] We implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL. We further integrate this procedure into one application, namely into CeTA, a formally verified certifier to check untrusted…
Albert No
The size of the largest binary single deletion code has been unknown for more than 50 years. It is known that Varshamov-Tenengolts (VT) code is an optimum single deletion code for block length $n\leq10$; however, only a few upper bounds of the size of single deletion code are proposed for larger n. We provide improved…
Tadashi Kadowaki, Mitsuru Ambai
In edge computing, suppressing data size is a challenge for machine learning models that perform complex tasks such as autonomous driving, in which computational resources (speed, memory size and power) are limited. Efficient lossy compression of matrix data has been introduced by decomposing it into the product of an…