Parallel Representation of Local Elimination Algorithm for Accelerating the Solving Sparse Discrete Optimization Problems

Computer Research and Modeling - Russian Federation
doi 10.20537/2076-7633-2015-7-3-699-705
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Izhevsk Institute of Computer Science

Related search

Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems

Industrial & Engineering Chemistry Research
ChemistryChemical EngineeringManufacturing EngineeringIndustrial
2014English

An Efficient Quantum Multiverse Optimization Algorithm for Solving Optimization Problems

International Journal of Advances in Applied Sciences
2020English

Local Search for Parallel Optimization Algorithms for High Diminsional Optimization Problems

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2018English

A Dual-Based Combinatorial Algorithm for Solving Cyclic Optimization Problems

Recent Patents on Computer Science
2012English

A Feasibility-Preserving Local Search Operator for Constrained Discrete Optimization Problems

2008English

Solving Graph Coloring Problem Using Parallel Discrete Particle Swarm Optimization on CUDA

DEStech Transactions on Engineering and Technology Research
2017English

Water Wave Optimization Algorithm for Solving Economic Dispatch Problems With Generator Constraints

International Journal of Intelligent Engineering and Systems
EngineeringComputer Science
2016English

Reducing Elimination Tree Height for Parallel LU Factorization of Sparse Unsymmetric Matrices

2014English

A Parallel Algorithm for Topology Optimization

1994English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy