Search
Now showing items 31-40 of 142
A hierarchical approach for solving simultaneous lot sizing and scheduling problem with secondary resources
(Elsevier, 2019)
This study represents a decomposition heuristic approach for simultaneous lot sizing and scheduling problem for multiple product, multiple parallel machines with secondary resources. The motivation of the study comes from ...
The one-warehouse multiretailer problem with an order-up-to level inventory policy
(Wiley, 2010-10)
We consider a two-level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order-up-to level inventory policy over T periods and faces an external demand which is dynamic ...
Modelling and solving an m-location, n-courier, priority-based planning problem on a network
(Springer Nature, 2012-01)
In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the ...
Reassessment and monitoring of loan applications with machine learning
(Taylor & Francis, 2018-11-26)
Credit scoring and monitoring are the two important dimensions of the decision-making process for the loan institutions. In the first part of this study, we investigate the role of machine learning for applicant reassessment ...
The attractive traveling salesman problem
(Elsevier, 2010-05-16)
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ...
Applying migrating birds optimization to credit card fraud detection
(Springer Science+Business Media, 2013)
We discuss how the Migrating Birds Optimization algorithm (MBO) is applied to statistical credit card fraud detection problem. MBO is a recently proposed metaheuristic algorithm which is inspired by the V flight formation ...
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
(Elsevier, 2013-03)
We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree ...
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
(Elsevier, 2012-05)
We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and ...
Relaxations and exact solution of the variable sized bin packing problem
(Springer Science+Business Media, 2011-03)
We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this ...
Exact method for robotic cell problem
(Elsevier, 2010-08-01)
This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this ...
Share this page