## Search

Now showing items 1-10 of 40

#### Minimum cost path problem for Plug-in Hybrid Electric Vehicles

(Elsevier Ltd, 2015)

We introduce a practically important and theoretically challenging problem: finding the minimum cost path for PHEVs in a road network with refueling and charging stations. We show that this problem is NP-complete and present ...

#### A hub covering model for cargo delivery systems

(Wiley, 2007)

The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each ...

#### 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, three-dimensional military surveillance radar is studied. Although the radar is mechanically steered in the sense that a ...

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

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

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

#### Energy minimizing vehicle routing problem

(Springer, 2007)

This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehicle-routing problem with this new load-based cost objective is called the Energy ...

#### New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints

(Elsevier, 2011)

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

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