Results 61 to 70 of about 35,538 (168)

The Effectiveness of Genetic Algorithm, And the CDS Method In Solving Flowshop Scheduling Problems [PDF]

E3S Web of Conferences
Flow shop scheduling problem is considered NP-hard for m machines and n jobs. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we used Genetic Algorithm, and the CDS
Prassetiyo Hendro, Heryati Firda
doaj   +1 more source

Innovative Ways of Developing and Using Specific Purpose Alternatives for Solving Hard Combinatorial Network Routing and Ordered Optimisation Problems

AppliedMath
This paper reviews some recent contributions by the authors and their associates and highlights a few innovative ideas, which led them to address some hard combinatorial network routing and ordered optimisation problems. The travelling salesman, which is
Santosh Kumar, Elias Munapo
doaj   +1 more source

Co-Clustering under the Maximum Norm

Algorithms, 2016
Co-clustering, that is partitioning a numerical matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard.
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier   +3 more
doaj   +1 more source

Improving Logic-based Benders' Algorithms for Solving Min-max Regret Problems

Operations Research and Decisions, 2021
This paper addresses a class of problems under interval data uncertainty, composed of min-max regret generalisations of classical 0-1 optimisation problems with interval costs.
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade   +3 more
doaj  

Topology Knapsack Problem for Geometry Optimization

IEEE Access
The knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li, Po-Chun Chang, Yuan-Hsun Liao   +2 more
doaj   +1 more source

Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits. [PDF]

Sci Rep, 2022
Popp C, Hiesmayr BC.
europepmc   +1 more source

Embedding Ordinal Optimization into Tree–Seed Algorithm for Solving the Probabilistic Constrained Simulation Optimization Problems

Applied Sciences, 2018
Probabilistic constrained simulation optimization problems (PCSOP) are concerned with allocating limited resources to achieve a stochastic objective function subject to a probabilistic inequality constraint.
Shih-Cheng Horng, Shieh-Shing Lin
doaj   +1 more source

Identification and signatures based on NP-hard problems of indefinite quadratic forms

Journal of Mathematical Cryptology, 2008
We prove NP-hardness of equivalence and representation problems of quadratic forms under probabilistic reductions, in particular for indefinite, ternary quadratic forms with integer coefficients.
Hartung Rupert J., Schnorr Claus-Peter
doaj   +1 more source

A New Provably Secure Cryptosystem Using Dedekind Domain Direct Product Approach

Ratio Mathematica, 2018
We would like to prevent, detect, and protect communication and information systems' attacks, which include unauthorized reading of a message of file and traffic analysis or active attacks, such as modification of messages or files, and denial of service
Amir Hassani Karbasi
doaj   +1 more source

Polynomially Solvable Cases of the Project Scheduling Problem with Changing Consumption and Supply Rates of Nonaccumulative Resources

Известия Иркутского государственного университета: Серия "Математика", 2014
We consider a strongly NP-hard project scheduling problem with nonaccumulative resources and sequence constraints. A distinctive feature of the formulation is that the rate of resource consumption by a task may change in duration of the task, and the ...
A.V.Eremeev, J.V. Kovalenko
doaj