Relevant Boolean Programming Problems

Vitaly A. Strusevich () and Kabir Rustogi
Additional contact information
Vitaly A. Strusevich: University of Greenwich
Kabir Rustogi: University of Greenwich

Chapter Chapter 4 in Scheduling with Time-Changing Effects and Rate-Modifying Activities, 2017, pp 57-90 from Springer

Abstract: Abstract Quite often, an algorithm that finds either an exact or an approximate solution to a scheduling problem can be derived from a reformulation of the original problem in terms of another problem of combinatorial optimization, e.g., a Boolean programming problem.

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:isochp:978-3-319-39574-6_4

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

DOI: 10.1007/978-3-319-39574-6_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().