Known Concepts and Solution Techniques

Torben Kuschel
Additional contact information
Torben Kuschel: University of Wuppertal

Chapter Chapter 3 in Capacitated Planned Maintenance, 2017, pp 25-70 from Springer

Abstract: Abstract Known mathematical concepts and solution techniques are introduced, which are used to solve the Capacitated Planned Maintenance Problem (CPMP) and the Weighted Uncapacitated Planned Maintenance Problem (WUPMP). This includes an introduction to computational complexity, linear and integer programming, Lagrangean relaxation and methods to solve the Lagrangean dual, Benders’ decomposition, local and tabu search and the Knapsack Problem.

Keywords: Knapsack Problem; Master Problem; Lagrangean Relaxation; Valid Inequality; Simplex Algorithm (search for similar items in EconPapers)
Date: 2017
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:lnechp:978-3-319-40289-5_3

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

DOI: 10.1007/978-3-319-40289-5_3

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().