Search
Search Results
-
Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints
In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same...
-
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for...
-
Representation Formulae for the Determinant in a Neighborhood of the Identity
We prove an integral representation and a power series expansion for the function...
-
Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
This work presents efficient solution approaches for a new complex NP-hard combinatorial optimization problem, the Pollution Location Inventory...
-
Tradeoff Relation between Mutual Information and Error Probability in Data Classification Problem
AbstractA data classification model in which the average mutual information between source objects and made decisions is a function of the error...
-
A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
In this paper, we propose a theoretical framework of a predictor-corrector interior-point method for linear optimization based on the one-norm wide...
-
A comprehensive study on \((\alpha , \beta )\)-bipolar fuzzified rough set model based on bipolar fuzzy preference relation and corresponding decision-making applications
Preference analysis is an essential component of the decision-making (DM) process for identifying the optimal object. The rough set (RS) theory has...
-
Relation between Fourier series and Wiener algebras
New relations between the Banach algebras of absolutely convergent Fourier integrals of complex-valued measures of Wiener and various issues of...
-
An intensification approach based on fitness landscape characteristics for job shop scheduling problem
This work deals with the classical Job Shop Scheduling Problem (JSSP) of minimizing the makespan. Metaheuristics are often used on the JSSP solution,...
-
Quasi-Solution Method and Global Minimization of the Residual Functional in Conditionally Well-Posed Inverse Problems
AbstractA class of conditionally well-posed problems characterized by a Hölder conditional stability estimate on a convex compact set in a Hilbert...
-
-
On the Problem of Controlling a Nonlinear System by a Discrete Control under Disturbance
AbstractWe consider the problem of stabilization to zero under disturbance in terms of a differential pursuit game. The dynamics is described by a...
-
Basic variable neighborhood search for the minimum sitting arrangement problem
The minimum sitting arrangement (MinSA) problem is a linear layout problem consisting in minimizing the number of errors produced when a signed graph...
-
The Exceptional Tits Quadrangles Revisited
Tits polygons are generalizations of Moufang polygons in which the neighborhood of each vertex is endowed with an “opposition relation.” There is a...
-
On the Uniqueness of Continuation for Polynomials of Harmonic Quaternion Fields
The paper provides a counterexample to the hypothesis on the uniqueness of continuation for polynomials of harmonic quaternion fields in a compact...
-
Fibration map**s of topological left almost semigroups
We discuss the notion of fibration property of continuous functions in the theory of topological left almost semigroups. The concept of L-fibration...