Search
Now showing items 1-4 of 4
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 ...
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
(Springer Science+Business Media, 2013-11)
The airline’s ability to offer flight schedules that provide service to passengers at desired times in competitive markets, while matching demand with an aircraft fleet of suitable size and composition, can significantly ...
Development of lower bounds for the scheduling of setup tasks in serial production lines
(Inderscience Publishers, 2013)
Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and ...
Solving the steiner tree problem with revenues, budget and hop constraints to optimality
(IEEE, 2013)
We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well ...
Share this page