Neighborhood search heuristics for the uncapacitated facility location problem

D Ghosh - European Journal of Operational Research, 2003 - Elsevier
The uncapacitated facility location problem is one of choosing sites among a set of
candidates in which facilities can be located, so that the demands of a given set of clients …

An efficient arithmetic optimization algorithm for solving subset-sum problem

MK Madugula, SK Majhi… - … international conference on …, 2022 - ieeexplore.ieee.org
The Subset-Sum Problem (SSP) ensures a significant role in various practical applications,
which include cryptography and coding theory owing to the importance in the functionality of …

A genetic algorithm for subset sum problem

RL Wang - Neurocomputing, 2004 - Elsevier
This paper presents an improved genetic algorithm (GA) for solving the subset sum problem
(SSP). Unlike a conventional GA, the proposed algorithm performs conditional (and not …

Traffic engineering for MPLS-based virtual private networks

CT Chou - Computer Networks, 2004 - Elsevier
This paper considers the traffic engineering of MPLS-based Virtual Private Networks (VPNs)
with multiple classes of service in an offline and centralised setting. We focus on two main …

Maximum utilization of vehicle capacity: A case of MRO items

A Sarkar, PKJ Mohapatra - Computers & Industrial Engineering, 2008 - Elsevier
With the pressure to remain competitive, organizations are increasingly depending on third
parties for support for logistical services like transportation, particularly for MRO items that …

Systems and methods for best-fit allocation in a warehouse environment

DL Wertheimer - US Patent 7,930,050, 2011 - Google Patents
In accordance with some embodiments of the invention, an optimal allocation of items to
meet a particular order is calculated. The items, then, may be allocated to the order …

On k-subset sum using enumerative encoding

V Parque, T Miyashita - 2016 IEEE International Symposium on …, 2016 - ieeexplore.ieee.org
Being a significant construct in a wide range of combinatorial problems, the k-subset sum
problem (k-SSP) computes k-element subsets, out of an n-element set, satisfying a user …

Tackling the Subset Sum Problem with Fixed Size using an Integer Representation Scheme

V Parque - 2021 IEEE Congress on Evolutionary Computation …, 2021 - ieeexplore.ieee.org
Addressing the subset sum problem is relevant to study resource management problems
efficiently. In this paper, we study a new scheme to sample solutions for the subset sum …

Techniques for solving subset sum problems within a given tolerance

RJW James, RH Storer - International Transactions in …, 2005 - Wiley Online Library
The subset sum problem is a simple and fundamental NP‐hard problem that is found in
many real world applications. For the particular application motivating this paper …

Generating combinations on the GPU and its application to the k-subset sum

V Parque - Proceedings of the Genetic and Evolutionary …, 2021 - dl.acm.org
Efficiently representing and generating combinations can allow the seamless visualization,
sampling, and evaluation of combinatorial architectures. In this paper, being relevant to …