eBook - ePub
Linear Integer Programming
Theory, Applications, Recent Developments
This is a test
- 200 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
Book details
Book preview
Table of contents
Citations
About This Book
This book presents the state-of-the-art methods in Linear Integer Programming, including some new algorithms and heuristic methods developed by the authors in recent years. Topics as Characteristic equation (CE), application of CE to bi-objective and multi-objective problems, Binary integer problems, Mixed-integer models, Knapsack models, Complexity reduction, Feasible-space reduction, Random search, Connected graph are also treated.
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Linear Integer Programming by Elias Munapo, Santosh Kumar in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming. We have over one million books available in our catalogue for you to explore.
Information
Chapter 1 Segment search approach for the general linear integer model
Abstract
This chapter presents a segment-search approach for the general linear integer problem. In this approach the feasible region is divided into segments and searched for the optimal solution. The segments are searched in their ascending or descending order depending on the nature of the problem and a solution feasible in the kth segment is also optimal to the whole problem. This approach has the strength that large numbers of sub-problems that usually result in large linear problems can now be managed easily in this way.
Keywords: Linear integer problem, Sub-problems, Segment-search, Feasible region, Variable limits,
1.0 Introduction
The general linear integer programming model (LIP) is one of the most difficult class of problems in combinatorial optimization and is in the NP-complete class of hard problems. This is a linear programming problem in which variables are restricted to integer values. There are several techniques that are available that can be used to solve...
Table of contents
- Title Page
- Copyright
- Contents
- Acknowledgements
- About the authors
- Chapter 1âSegment search approach for the general linear integer model
- Chapter 2âImproved solution method for the 0-1 GAP model
- Chapter 3âA search for an optimal integer solution over the integer polyhedron â Two iterative approaches
- Chapter 4âUse of variable sum limits to solve the knapsack problem
- Chapter 5âThe characteristic equation for linear integer programs
- Chapter 6âRandom search method for integer programming
- Chapter 7âSome special linear integer models and related problems
- Chapter 8âThe travelling salesman problem: Sub-tour elimination approaches and algorithms
- Index
- De Gruyter Series on the Applications of Mathematics in Engineering and Information Sciences