The Generate and Solve GS methodology is a hybrid approach that combines a metaheuristics component with an exact solver. GS has been recently introduced into the literature in order to solve the problem of dynamic coverage and connectivity in wireless sensor networks, showing promising results. The GS framework includes a metaheuristics engine e. Introduction High power consumption efficiency in wireless sensor networks is always desirable. The integrative collaboration of genetic algorithms and integer linear programming as specified by this methodology tries to merge their strong points and has offered significant results when applied to wireless sensor networks domains.
|Published (Last):||3 October 2007|
|PDF File Size:||15.87 Mb|
|ePub File Size:||20.75 Mb|
|Price:||Free* [*Free Regsitration Required]|
Melar Discrete Applied Mathematics 26, However, the space search can be very large combinatorial explosion and, as a consequence, exhaustive search is usually prohibitive. In order to study these techniques, it is important to understand integwr notions from integer programming and graphs theory total unimodularity, matching, spanning tree, etc. Combinatorial optimization Valid Inequalities and Preprocessing. Handbooks in operations research and management science 7, It is also a valuable reference for industrial users of integer programming and researchers who would like to keep up with advances in the field.
The Traveling Salesman Problem. Later, they will be applied to the study of specific problems and solution algorithms. Added to Your Shopping Cart. Typical such problems are routing problems, matching problems or scheduling problems. Description A practical, accessible guide to optimization problems with discrete or integer variables Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems, such as airline timetables, production line schedules, or electricity production on a regional or national scale.
We will first cover some basic notions in integer programming and graph theory. Faces l. Table of contents Features Formulations. On completion of programing course, the student will be able to: Complexity and Problem Reductions. Humanities and Social Science. Integer Programming Laurence A. Articles 1—20 Show more.
These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branch-and-cut and integer programming decomposition algorithms. In many optimization problems, the solution is found among a set of finite elements. Integer Programming Therefore, specialized mathematical techniques must be used to explore the solution space in an efficient way. You inteegr currently using the site but have requested a page in the site.
Medicine and Veterinary Medicine. Email address for updates. An analysis of the greedy algorithm for the submodular set covering problem LA Wolsey Combinatorica 2 4, Best algorithms for approximating wkley maximum of a submodular set function GL Nemhauser, LA Wolsey Mathematics of operations research 3 3, Wolsey presents a number of state-of-the-art topics not covered in any other textbook.
Would you like to change to the site? Mrs Frances Reid Tel:.
has been cited by the following article: