Combinatorial model of chromatography applied on optimizing operational conditions in SEC
The shape of the elution curves depends strongly on experimental conditions, in
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
The shape of the elution curves depends strongly on experimental conditions, in
algorithm. A meta-heuristic algorithm Ant Colony optimization which is applied on the combinatorial optimized problems to get the optimal solution. Among common combinatorial problems one is Travelling-Salesman Problem…
Colony Optimization (ACO) is a Meta heuristic combinatorial optimization technique. Ant Colony System (ACS) is the algorithm in the ACO. This is based on the behavior of ants. Many ants
principles of ant colony optimization (ACO), and developed to solve the binary and combinatorial optimization problems. It simulates restructured electricity markets, to explore the impact of consumers’ price elasticity
University course timetabling is known to be hard combinatorial optimization problem. It is difficult to tackle the constraints including the classroom, course and the teacher requirement. Some optimization approaches…
After proposing the first quantum algorithm for multiobjective combinatorial optimization problems using a convex combination of different objective functions, using the well-known two parabola problem as a simple…
Objective function-based clustering is here looked as a maximum-weight set partitioning combinatorial optimization problem, with the instance given by a pseudo-Boolean (set) function assigning real-valued cluster
design of water system systems is taken into account a combinatorial optimization task during which the diameter of every one among the pipes are often considered as a choice variable
computing, a key technology of the coming decades, is expected to excel in solving combinatorial optimization problems better than traditional methods. This study reviews current quantum optimization applications in…
generate several data-driven classification systems, which helps in taking business decisions. Optimization approach in data mining strengthens the validity of organizing results and the improved collection…
continuous and discrete decision variables, and belong to the NP-hard class of optimization problems that are difficult to solve. Recently, novel algorithms inspired by the Greedy Random Adaptive Search ... spacecraft…
most popular scheduling models existing in practice, which is among the hardest combinatorial optimization problems . Particle Swarm Optimization (PSO) is a population based metaheuristic that takes advantage of…
loss and to prevent overload in the network. Since network reconfiguration is a complex combinatorial optimization problem with several constraints, many algorithms are proposed in the past. The integrated approach
problems as due to local optimum solution convergence. This work proposes a novel metaheuristic optimization methodology aimed at solving economic dispatch problem considering valve point loading effects. The…
aids decision making on the effectiveness of the targeted oncology drug and in optimizing potential combinatorial options to combat resistance. These strategies and how they are implemented clinically will
science and technological disciples have been classified as computationally NP hard like combinatorial optimization, prime factorization of large integer, finding the ground state of the Ising Hamiltonian. More…
genetic algorithm is one of the best algorithms in order to solve many combinatorial optimization problems, especially traveling salesman problem. Genetic algorithm application produces quickly convergent results when
context of resource allocation, virtual machine placement (VMP) is one of the most studied combinatorial optimization problems with several possible formulations and a large number of existing optimization criteria
topological properties to the underlying molecular features. Such community detection approaches are based on combinatorial optimization principles, involve data from various high throughput experiments and span…
Assembly sequence planning is a typical of representative combinatorial optimization problems in manufacturing. The general methods are used to generate a large number of feasible assembly sequences and find
difficult, although the problem is easily expressed. TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background. The aim of our work
need for network reconfiguration from time to time. Network Reconfiguration is a complex combinatorial optimization process aimed at finding a radial operating structure that minimizes the system power losses. This
clear. Finally, two aspects including supply chain finance and traditional financing mode ratio and combinatorial optimization of capital constrained supply chain have been studied concretely, and in which the…
network channels. Similar kind of algorithms has been devised to solve various combinatorial optimization problems including routing, shortest path, packet transmission, assignments and many more. These algorithms…
suitable for revealing factors affecting gene lengths. The selected method of comparison is combinatorial optimization. We have demonstrated that all considered methods give consistent results and that bubble sort
For authors and organisers
Find the right journal for your paper and submit your manuscript.