Results 181 to 190 of about 151,418 (244)

Complexity Analysis and Algorithm Design of Pooling Problem

Journal of the Operations Research Society of China, 2018
The pooling problem, also called the blending problem, is fundamental in production planning of petroleum. It can be formulated as an optimization problem similar with the minimum-cost flow problem. However, Alfaki and Haugland (J Glob Optim 56:897–916, 2013) proved the strong NP-hardness of the pooling problem in general case.
Yu‐Hong Dai, Rui Diao, Kai Fu
openalex   +3 more sources

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Journal of Scheduling, 2021
We study several two-machine shop scheduling problems, namely flow shop, job shop and open shop scheduling problems under linear constraints. In these problems, the processing times of two stages of jobs are also decision variables and satisfy a system of linear constraints.
Kameng Nip, Zhenbo Wang
openalex   +3 more sources

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers & Operations Research, 2013
We consider the asymmetric bottleneck traveling salesman problem on a complete directed graph on n nodes. Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis.
John Larusic, Abraham P. Punnen
openalex   +2 more sources

Complexity Analysis, Potential Game Characterization and Algorithms for the Inter-Cell Interference Coordination With Fixed Transmit Power Problem

IEEE Transactions on Vehicular Technology, 2017
We study the inter-cell interference coordination (ICIC) problem in a multicell orthogonal frequency division multiple access based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MSs) in a given time slot so as to limit the interference to neighboring ...
Vaibhav Kumar Gupta, Ashwathi Nambiar, Gaurav S. Kasbekar   +2 more
openalex   +4 more sources

Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem

2013 IEEE Congress on Evolutionary Computation, 2013
We propose a new construction procedure for ant colony optimization (ACO) algorithms working on the Euclidean traveling salesperson problem (TSP) that preserves the ordering on the convex hull of the points in the instance. The procedure is inspired by theoretical analyses for simple evolutionary algorithms that are provably more efficient on instances
Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann   +2 more
openalex   +3 more sources

Exploring Heuristic Algorithms for the Knapsack Problem: A Comparative Analysis of Program Complexity and Computational Efficiency

Kasu Journal of Computer Science
The knapsack problem is an optimization problem in computer science which involves determining the most valuable combination of items that can be packed into a knapsack (a container) with a limited capacity (weight or volume); the goal is to maximize the total profit of the items included in the knapsack without exceeding its capacity.
Bashar Bin Usman, Saminu Isah Kanoma, Ibrahim Zakariyau, Hashimu Abubakar Niworu, Adebayo Ademola Rilwan   +4 more
openalex   +2 more sources

Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows

, 2017
Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with ...
Mirosław Błocho, Jakub Nalepa
openalex   +3 more sources

A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems

Journal of Optimization Theory and Applications, 2013
In this paper, we first present a full-Newton step feasible interior-point algorithm for solving horizontal linear complementarity problems. We prove that the full-Newton step to the central path is quadratically convergent. Then, we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problems ...
Behrouz Kheirfam
openalex   +3 more sources

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem

2015 7th International Conference on Communication Systems and Networks (COMSNETS), 2015
We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed ...
Ashwathi Nambiar, Gaurav S. Kasbekar
openalex   +3 more sources

Algorithms and complexity analysis for some flow problems

ACM-SIAM Symposium on Discrete Algorithms, 1991
Edith Cohen, Nimrod Megiddo
openalex   +2 more sources