Browsing by Keywords "Computational studies"
Now showing items 19 of 9

Application of the Ugi reaction with multiple amino acidderived components: Synthesis and conformational evaluation of piperazinebased minimalist peptidomimetics
(Royal Society of Chemistry, 2015)The concurrent employment of αamino acidderived chiral components such as aldehydes and αisocyanoacetates, in a sequential Ugi reaction/cyclization twostep strategy, opens the door to the synthesis of three structurally ... 
A branchandprice 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 leastcost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ... 
An intermodal multicommodity routing problem with scheduled services
(2012)We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to ... 
Minimizing weighted mean absolute deviation of job completion times from their weighted mean
(Elsevier, 2011)We address a singlemachine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the ... 
Nearoptimal modified base stock policies for the capacitated inventory problem with stochastic demand and fixed cost
(World Scientific Publishing, 2014)In this study, we investigate a singleitem, periodicreview inventory problem where the production capacity is limited and unmet demand is backordered. We assume that customer demand in each period is a stationary, discrete ... 
New formulations for the hopconstrained minimum spanning tree problem via Sherali and Driscoll's tightened MillerTuckerZemlin constraints
(Elsevier, 2010)Given an undirected network with positive edge costs and a natural number p, the hopconstrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ... 
Robust scheduling and robustness measures for the discrete time/cost tradeoff problem
(Elsevier, 2010)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 ... 
Scheduling beams with different priorities on a military surveillance radar
(Institute of Electrical and Electronics Engineers, 2012)The problem of scheduling the searching, verification, and tracking tasks of a ground based, threedimensional military surveillance radar is studied. Although the radar is mechanically steered in the sense that a ... 
Star phub center problem and star phub median problem with bounded path lengths
(2012)We consider two problems that arise in designing twolevel star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect ...