## Search

Now showing items 11-20 of 33

#### Generating facets for the independence system

(Society for Industrial and Applied Mathematics, 2009)

In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the ...

#### An algorithm and a core set result for the weighted euclidean one-center problem

(Institute for Operations Research and the Management Sciences (I N F O R M S), 2009)

Given a set A of m points in n-dimensional space with corresponding positive weights, the weighted Euclidean one-center problem, which is a generalization of the minimum enclosing ball problem, involves the computation of ...

#### Ant colony optimization for the single model U-type assembly line balancing problem

(Elsevier, 2009)

An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject ...

#### The hierarchical hub median problem with single assignment

(Elsevier, 2009)

We study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting ...

#### Pricing American contingent claims by stochastic linear programming

(Taylor & Francis, 2009)

We consider pricing of American contingent claims (ACC) as well as their special cases, in a multi-period, discrete time, discrete state space setting. Until now, determining the buyer's price for ACCs required solving an ...

#### Using imperfect advance demand information in ordering and rationing decisions

(Elsevier, 2009)

In this paper, we consider an inventory problem with two demand classes having different priorities. The appropriate policy of rationing the available stock, i.e. reserving some stock for meeting prospective future demand ...

#### 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 ...

#### A hub covering network design problem for cargo applications in Turkey

(Palgrave Macmillan, 2009)

Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location ...

#### A tabu-search based heuristic for the hub covering problem over incomplete hub networks

(Elsevier, 2009)

Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over ...

#### A subgradient descent algorithm for optimization of initially controllable flow shop systems

(2009)

We consider an optimization problem for deterministic flow shop systems processing identical jobs. The service times are initially controllable; they can only be set before processing the first job, and cannot be altered ...