Browsing by Keywords "Computational results"
Now showing items 1-14 of 14
-
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007)The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ... -
Benchmark Solutions of Large Problems for Evaluating Accuracy and Efficiency of Electromagnetics Solvers
(IEEE, 2011)We present a set of benchmark problems involving conducting spheres and their solutions using a parallel implementation of the multilevel fast multipole algorithm (MLFMA). Accuracy of the implementation is tested by comparing ... -
Bicriteria multiresource generalized assignment problem
(John Wiley & Sons, 2014)In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective ... -
A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
(Elsevier Ltd, 2017)We study the vehicle routing problem with roaming delivery locations in which the goal is to find a least-cost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ... -
Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
(Pergamon Press, 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 ... -
Double bound method for solving the p-center location problem
(Elsevier, 2013)We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ... -
An integrated approach for airline scheduling, aircraft fleeting and routing with cruise speed control
(Elsevier, 2016)To place an emphasis on profound relations among airline schedule planning problems and to mitigate the effect of unexpected delays, we integrate schedule design, fleet assignment and aircraft routing problems within a ... -
Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
(2013)We describe a challenging class of large mixed-integer second-order cone programming models which arise in computing the maximum price that a buyer is willing to disburse to acquire an American contingent claim in an ... -
The multi-terminal maximum-flow network-interdiction problem
(2011)This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K ≥ 3 pre-specified node groups while an interdictor ... -
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
(Elsevier, 2010)Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ... -
A polyhedral study of multiechelon lot sizing with intermediate demands
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2012)In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a ... -
The ring/κ-rings network design problem: model and branch-and-cut algorithm
(John Wiley & Sons, 2016)This article considers the problem of designing a two-level network where the upper level consists of a backbone ring network connecting the so-called hub nodes, and the lower level is formed by access ring networks that ... -
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
(Elsevier, 2009)We describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be ... -
Volumetric plasmonic resonator architecture for thin-film solar cells
(AIP Publishing, 2011-03-04)We propose and demonstrate a design concept of volumetric plasmonic resonators that relies on the idea of incorporating coupled layers of plasmonic structures embedded into a solar cell in enhanced optical absorption for ...
