## Search

Now showing items 1-10 of 21

#### Regenerator location problem and survivable extensions: a hub covering location perspective

(Elsevier, 2015)

In a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem ...

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

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

#### Compromising system and user interests in shelter location and evacuation planning

(Elsevier Ltd, 2015)

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority's point of view, the ...

#### A branch and price approach for routing and refueling station location model

(Elsevier, 2016)

The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest ...

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

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

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

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