Results 11 to 20 of about 5,149,202 (297)

Local and global lifted cover inequalities for the multidimensional knapsack problem [PDF]

open access: yes, 2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well-known (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upper bounding techniques for the 0-1 MKP have been based on Lagrangian or ...
Kaparis, Konstantinos, Letchford, A N
core   +5 more sources

Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems

open access: yesMathematics, 2023
The moth search algorithm (MS) is a relatively new metaheuristic optimization algorithm which mimics the phototaxis and Lévy flights of moths. Being an NP-hard problem, the 0–1 multidimensional knapsack problem (MKP) is a classical multi-constraint ...
Yanhong Feng   +4 more
doaj   +1 more source

An Efficient Kriging Modeling Method Based on Multidimensional Scaling for High-Dimensional Problems

open access: yesAlgorithms, 2021
Kriging-based modeling has been widely used in computationally intensive simulations. However, the Kriging modeling of high-dimensional problems not only takes more time, but also leads to the failure of model construction.
Yu Ge   +3 more
doaj   +1 more source

Some Method for Constructing Cycles in a Graph

open access: yesСовременные информационные технологии и IT-образование, 2022
Multidimensional matrices are a powerful tool for solving various fundamental scientific problems and applied scientific and technical problems. As examples of the use of multidimensional matrices in various fields, one can cite the work of the creator ...
Victor Munerman, Daniel Munerman
doaj   +1 more source

Approximate Solutions of Multidimensional Wave Problems Using an Effective Approach

open access: yesJournal of Function Spaces, 2023
The main goal of this paper is to introduce a new scheme for the approximate solution of 1D, 2D, and 3D wave equations. The recurrence relation is very important to deal with the approximate solution of differential problems.
Muhammad Nadeem   +2 more
doaj   +1 more source

Approximation Theorems Associated with Multidimensional Fractional Fourier Transform and Applications in Laplace and Heat Equations

open access: yesFractal and Fractional, 2022
In this paper, we establish two approximation theorems for the multidimensional fractional Fourier transform via appropriate convolutions. As applications, we study the boundary and initial problems of the Laplace and heat equations with chirp functions.
Yinuo Yang   +3 more
doaj   +1 more source

On Construction of Partially Dimension-Reduced Approximations for Nonstationary Nonlocal Problems of a Parabolic Type

open access: yesMathematics, 2023
The main aim of this article is to propose an adaptive method to solve multidimensional parabolic problems with fractional power elliptic operators.
Raimondas Čiegis   +3 more
doaj   +1 more source

Using shifted Legendre orthonormal polynomials for solving fractional optimal control problems [PDF]

open access: yesIranian Journal of Numerical Analysis and Optimization, 2022
‎‎shifted Legendre orthonormal polynomials (SLOPs) are used to approximate the numerical solutions of fractional optimal control problems‎. ‎To do so‎, ‎first‎, ‎the operational matrix of the Caputo fractional derivative‎, ‎the SLOPs‎, ‎and Lagrange ...
R. Naseri, A. Heydari, A.S. Bagherzadeh
doaj   +1 more source

A framework for the visualization of multidimensional and multivariate data [PDF]

open access: yes, 2004
High dimensionality is a major challenge for data visualization. Parameter optimization problems require an understanding of the behaviour of an objective function in an n-dimensional space around the optimum - this is multidimensional visualization and ...
Dos Santos, Selan Rodrigues
core   +7 more sources

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem [PDF]

open access: yes, 2008
An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the ...
Salhi, Said   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy