Search
Now showing items 1-10 of 16
A computational study of lower bounds for the two dimensional bin packing problem
(Elsevier, 2010-08-01)
We survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ...
Robust aircraft routing and flight retiming
(Elsevier, 2010-08-01)
In this paper, we propose an integrated model for the robust aircraft routing and flight retiming problem. The model optimizes a slack-based robustness measure that explicitly takes heed of passengers in connection and ...
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
(Elsevier, 2010-08-01)
This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ...
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 ...
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 ...
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 ...
Integrated airline schedule design and fleet assignment: polyhedral analysis and benders’ decomposition approach
(Informs, 2010-01)
The main airline operations consist of schedule planning, fleet assignment, aircraft routing, and crew scheduling. To improve profitability, we present in this paper an integrated fleet assignment model with schedule ...
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
(Elsevier, 2010-12-01)
Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that ...
IP-based energetic reasoning for the resource constrained project scheduling problem
(Elsevier, 2010-08-01)
In this paper, we consider the Resource Constrained Project Scheduling Problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental ...
Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version
(Elsevier, 2010-04)
This paper investigates the budget variant of the discrete time/cost trade-off problem (DTCTP). This multi-mode project scheduling problem requires assigning modes to the activities of a project so that the total completion ...
Share this page