Integer Programing

Joseph L. Awange (), Béla Paláncz (), Robert H. Lewis () and Lajos Völgyesi ()
Additional contact information
Joseph L. Awange: Curtin University, Department of Spatial Sciences, School of Earth and Planetary Sciences
Béla Paláncz: Budapest University of Technology and Economics, Department of Geodesy and Surveying, Faculty of Civil Engineering
Robert H. Lewis: Fordham University
Lajos Völgyesi: Budapest University of Technology and Economics, Department of Geodesy and Surveying, Faculty of Civil Engineering

Chapter 8 in Mathematical Geosciences, 2023, pp 275-317 from Springer

Abstract: Abstract Integer programming as a solution of discrete value problems is introduced. We consider typical types of these problems, such as binary programming, i.e. the set-covering problem. Their solution methods, such as binary countdown, branch and bound, are considered. Special techniques like Gröbner basis methods are also discussed. Techniques to solve mixed integer programming such as local linearization, global linearization via MaCormic Envelopes, and successive nonlinear methods, are used to solve the GNSS phase ambiguity problem.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-92495-9_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030924959

DOI: 10.1007/978-3-030-92495-9_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().