Results 1  10
of
14
Multiple Sink Network Design Problem
 In: Proc. of 1 st Int. Conf. on Communications (ICC). (2004
, 2004
"... Abstract — The battery resource of the sensor nodes should be managed efficiently, in order to prolong network lifetime in wireless sensor networks. Moreover, in largescale networks with a large number of sensor nodes, multiple sink nodes should be deployed, not only to increase the manageability o ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
(Show Context)
Abstract — The battery resource of the sensor nodes should be managed efficiently, in order to prolong network lifetime in wireless sensor networks. Moreover, in largescale networks with a large number of sensor nodes, multiple sink nodes should be deployed, not only to increase the manageability of the network, but also to reduce the energy dissipation at each node. In this paper, we focus on the multiple sink location problems in largescale wireless sensor networks. Different problems depending on the design criteria are presented. We consider locating sink nodes to the sensor environment, where we are given a time constraint that states the minimum required operational time for the sensor network. We use simulation techniques to evaluate the quality of our solution. Keywords—wireless sensor networks; power efficiency; multiple sink. I.
Using an Interior Point Method in a Branch and Bound Algorithm for Integer Programming.
, 1992
"... This paper describes an experimental code that has been developed to solve zeroone mixed integer linear programs. The experimental code uses a primaldual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
(Show Context)
This paper describes an experimental code that has been developed to solve zeroone mixed integer linear programs. The experimental code uses a primaldual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method. Computational results for a number of test problems are provided. Introduction Mixed integer linear programming problems are often solved by branch and bound methods. Branch and bound codes, such as the ones described in [7, 11, 12], normally use the simplex algorithm to solve linear programming subproblems that arise. In this paper, we describe an experimental branch and bound code for zeroone mixed integer linear programming problems that uses an interior point method to solve the LP subproblems. This project was motivated by the observation that interior point methods tend to quickly find feasible solutions with good objective values, but take a relatively long time to ...
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 9 (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.
A Discrete Choice Based Facility Location Model for Inland Container Depots
, 1999
"... Container transport operations have been extending inland, providing more comprehensive service across the shipping network. Accordingly, container transport operators are making extensive capital investments in deploying inland container depot (ICD) networks. Optimizing the location of such facilit ..."
Abstract
 Add to MetaCart
Container transport operations have been extending inland, providing more comprehensive service across the shipping network. Accordingly, container transport operators are making extensive capital investments in deploying inland container depot (ICD) networks. Optimizing the location of such facilities financially is vital for both capital and operating efficiencies. Currently, there are no models at the regional network level to guide container operators in locating ICDs on their networks. This research studies the ICD location problem and develops a comprehensive ICD location model. Based on comprehensive analysis of the container transport industry, focusing on ICD operations, this thesis developed a useful formulation of the ICD location problem. It recognizes and emphasizes the need to embody the endogenous demand and market competitiveness in the container transport business. The formulation combines the multinomial logit model of discrete choice analysis to quantitatively describe the shipper’s behaviors and preferences, addressing both the endogenous demand and market competitiveness. Fixed charge facility location problems are considered or proven to be NP complete.
© 2007 Science Publications An Efficient Algorithm for Capacitated Multifacility Location Problems
"... Abstract: In this paper, a squaredEuclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: In this paper, a squaredEuclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques is developed. The numerical experiments are randomly generated to test efficiency of the proposed algorithm compared with a linearization algorithm. The results show that the proposed algorithm provides a better solution on average with less processing time for all various sizes of problems.
DATE OF APPROVAL.................................................
, 2004
"... ii ..."
(Show Context)
Abstract Optimal Order Allocation with Discount Pricing
, 2006
"... We consider a problem of optimal order allocation faced for example by an internet trading agent who seeks to ful…l an order for speci…ed amounts of several products from a prearranged list of suppliers, taking into account availability and price. We present a mixed integer programming (MILP) formu ..."
Abstract
 Add to MetaCart
(Show Context)
We consider a problem of optimal order allocation faced for example by an internet trading agent who seeks to ful…l an order for speci…ed amounts of several products from a prearranged list of suppliers, taking into account availability and price. We present a mixed integer programming (MILP) formulation for the case that suppliers impose a …xed charge which is waived or discounted on orders above a certain threshold value. This formulation is extended to cases where suppliers operate a discount schedule with multiple price breaks. We show that a modi…ed capacitated facility location (CFLP) model is appropriate for the general case and outline a solution approach by Lagrangean relaxation. KEYWORDS: Discount pricing, capacitated facility location problem, Lagrangean relaxation, branch and bound, knapsack problem 1.
Optimal Supplier Choice with Discounting
, 2008
"... location This paper investigates a model for pricing the demand for a set of goods when suppliers operate discount schedules based on total business value. We formulate the buyers’s decision problem as a mixed binary integer program (MIP) which is a generalization of the capacitated facility locatio ..."
Abstract
 Add to MetaCart
(Show Context)
location This paper investigates a model for pricing the demand for a set of goods when suppliers operate discount schedules based on total business value. We formulate the buyers’s decision problem as a mixed binary integer program (MIP) which is a generalization of the capacitated facility location problem (CFLP). A branch and bound procedure using Lagrangean relaxation and subgradient optimization is developed for solving largescale problems that can arise when suppliers’ discount schedules contain multiple price breaks. Results of computer trials on specially adapted large benchmark instances of the CFLP, con…rm that a subgradient optimization procedure based on Shor and Zhurbenko’s ralgorithm, which employs a space dilation strategy in the direction of the di¤erence between two successive subgradients, can solve such instances e ¢ ciently. 1.
model
, 2006
"... This paper investigates a model for pricing the demand for a set of goods when multiple suppliers operate discount schedules based on total business value. We formulate the buyers’s decision problem as a mixed binary integer program (MIP) which is a generalization of the capacitated facility locatio ..."
Abstract
 Add to MetaCart
(Show Context)
This paper investigates a model for pricing the demand for a set of goods when multiple suppliers operate discount schedules based on total business value. We formulate the buyers’s decision problem as a mixed binary integer program (MIP) which is a generalization of the capacitated facility location problem (CFLP) and can be solved using Lagrangean heuristics. We have investigated commercially available MIPsolvers (LINGO, XpressMP) to solve smallscale examples. A branchandbound procedure using Lagrangean relaxation and subgradient optimization is developed for solving largescale problems that can arise when suppliers’discount schedules contain multiple price breaks. Results of computer trials on specially adapted large benchmark instances of the CFLP, con…rm that a subgradient algorithm can solve such instances e ¢ ciently. 1