Results 1 
7 of
7
Approximation Algorithms for Facility Location Problems
, 2005
"... This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005. ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.
IMPROVING ONDEMAND DATA ACCESS EFFICIENCY IN MANETS WITH APPROVED: COOPERATIVE CACHING
, 2005
"... Mobile Ad Hoc Networks (MANETs) provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. Its usage can further be extended by enabling communications with external networks such as Internet or cellular networks through g ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Mobile Ad Hoc Networks (MANETs) provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. Its usage can further be extended by enabling communications with external networks such as Internet or cellular networks through gateways. However, data access applications in MANETs suffer from dynamic network connections and restricted energy supplies. While most of the research focuses on Media Access Control (MAC) and routing layer solutions, we address these problems by application level cooperation which utilizes the locality principle and commonality in users ’ interests. In this dissertation, we explore how to use cooperative caching to improve data access efficiency in MANETs. We devised COOP, a novel cooperative caching scheme for ondemand data access applications in MANETs. The objective is to improve data availability and access efficiency by collaborating local resources of mobile nodes. COOP addresses two basic problems of cooperative caching: cache resolution and cache management, i.e. how to find requested data efficiently and how to manage an
Valid inequalities and facets of the capacitated plant location problem
 Mathematical Programming
, 1989
"... Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitate ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure. The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with constant capacity K for all plants. These facet inequalities depend on K and thus differ fundamentally from the valid inequalities for the uncapacitated version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.
Facility Location: Discrete Models and Local Search Methods
"... Abstract.Discrete location theory is one of the most dynamic areas of operations research. We present the basic mathematical models used in this field, as well as their properties and relationship with pseudoBoolean functions. We also investigate the theory of PLScomplete problems, average and wo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract.Discrete location theory is one of the most dynamic areas of operations research. We present the basic mathematical models used in this field, as well as their properties and relationship with pseudoBoolean functions. We also investigate the theory of PLScomplete problems, average and worst case computational complexity of the local search algorithms, and approximate local search. Finally, we discuss computationally difficult test instances and promising directions for further research.
Research Article A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. Available from: M. Sulaiman ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. Available from: M. Sulaiman
Research Article A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. Available from: M. Sulaiman ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. Available from: M. Sulaiman