Search
Now showing items 11-16 of 16
Algorithmic expedients for the prize collecting Steiner tree problem
(Elsevier, 2010)
This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ...
Calibrating artificial neural networks by global optimization
(2010-07)
An artificial neural network (ANN) is a computational model − implemented as a computer program − that is aimed at emulating the key features and operations of biological neural networks. ANNs are extensively used to model ...
An exact algorithm for the Steiner tree problem with delays
(Elsevier, 2010-08-01)
The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...
Discrepancy search for the flexible job shop scheduling problem
(Elsevier, 2010-12)
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ...
The traveling salesman problem with pickups, deliveries, and handling costs
(Informs, 2010-08)
This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ...
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
(Elsevier, 2010-08-06)
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ...
Share this page