Results 1  10
of
172
MINISUM AND MINIMAX LOCATION MODELS FOR HELICOPTER EMERGENCY MEDICAL SERVICE SYSTEMS
, 2012
"... Abstract This paper presents minisum and minimax location problems for helicopter emergency medical service (HEMS) systems. Given demand points (origins) and hospitals (destinations), the locations of rendezvous points and helicopter stations are selected to minimize the total demandweighted transp ..."
Abstract
 Add to MetaCart
introduced helicopter. We provide 01 integer formulations of the minisum and minimax problems, and develop a variable reduction procedure that reduces the size of the problem. Some optimal solutions of the proposed models tested for an idealized square city are analyzed. We also apply the models to the case study
Minimax Flow Tree Problems
, 2007
"... We examine a class of problems which seeks to find treestructured networks which minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters which can represent distance, flow volume, and delivery deadlines. Derived through variations in ..."
Abstract
 Add to MetaCart
We examine a class of problems which seeks to find treestructured networks which minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters which can represent distance, flow volume, and delivery deadlines. Derived through variations
A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE ADISTANCE
, 1994
"... Abstract Given demand points on a plane, we consider where a new facility should be located. In this article, we consider a single facility minisum location problem under the Adistance, and study properties of optimal solutions for the problem, and propose ''The Edge Tracing Algorithm &qu ..."
Abstract
 Add to MetaCart
Abstract Given demand points on a plane, we consider where a new facility should be located. In this article, we consider a single facility minisum location problem under the Adistance, and study properties of optimal solutions for the problem, and propose ''The Edge Tracing Algorithm
Minimax location problem with Adistance
 Journal of the Operations Research Society of Japan
, 1998
"... Abstract In this paper a single facility location problem for an ambulance service station in a polygonal area X is considered. Our objective is to locate an ambulance service station so as to minimize the maximum distance of the route which passes from the facility to the hospital by way of the sce ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract In this paper a single facility location problem for an ambulance service station in a polygonal area X is considered. Our objective is to locate an ambulance service station so as to minimize the maximum distance of the route which passes from the facility to the hospital by way
Approximation algorithms and mechanism design for minimax approval voting
 In Proceedings of the 24th AAAI Conference on Artificial Intelligence
, 2010
"... We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e.g., committee elections. We are interested in the minimax approval voting rule in which the outcome represents a compromi ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
be considered as alternative voting rules. We present a polynomialtime 2approximation algorithm that uses a natural linear programming relaxation for the underlying optimization problem and deterministically rounds the fractional solution in order to compute the outcome; this result improves upon
A minimax procedure for electing committees
, 2006
"... A new voting procedure for electing committees, called the minimax procedure, is described. Based on approval voting (AV), it chooses the committee that minimizes the maximum “Hamming distance ” to all voters (minimax outcome). Such an outcome may be diametrically opposed to the outcome obtained fr ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
the interests of all voters than a minisum committee. 3A Minimax Procedure for Electing Committees1 1.
Institut für Numerische und Angewandte Mathematik Locating a minisum circle on the plane with arbitrary norm
"... Locating a minisum circle on the plane with arbitrary norm ..."
PTAS for Minimax Approval Voting
"... Abstract. We consider Approval Voting systems where each voter decides on a subset of candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k, minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem and he ..."
Abstract
 Add to MetaCart
Abstract. We consider Approval Voting systems where each voter decides on a subset of candidates he/she approves. We focus on the optimization problem of finding the committee of fixed size k, minimizing the maximal Hamming distance from a vote. In this paper we give a PTAS for this problem
Approval Voting: Local Search Heuristics and Approximation Algorithms for the Minimax Solution
"... Voting has been the most general scheme for preference aggregation in multiagent settings involving agents of diverse preferences. Here, we study a specific type of voting protocols for multiwinner elections, namely approval voting, and we investigate the complexity of computing or approximating t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that the problem is NPhard and give a simple 3approximation algorithm. We then introduce and evaluate various heuristics based on local search. Our heuristics have low running times (and provably polynomial) and our experimental results show that they perform very well on average, computing solutions
Results 1  10
of
172