Multi-Objective Branch and Bound

Panos M. Pardalos, Antanas Žilinskas and Julius Žilinskas
Additional contact information
Panos M. Pardalos: University of Florida
Antanas Žilinskas: Vilnius University
Julius Žilinskas: Vilnius University

Chapter Chapter 5 in Non-Convex Multi-Objective Optimization, 2017, pp 45-56 from Springer

Abstract: Abstract Branch and bound branch and bound approaches for optimization problems were developed in the 1960s [114, 121]. The main concept of a branch and bound algorithm is to detect and discard sets of feasible decisions which cannot contain optimal decisions. The search process can be illustrated as a search tree with the root corresponding to the search space and branches corresponding to its subsets. An iteration of the algorithm processes a node in the search tree that represents an unexplored subset of feasible decisions. The iteration has three main components: selection of the subset to be processed, branching corresponding to subdivision of the subset, and bound calculation.

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:spochp:978-3-319-61007-8_5

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

DOI: 10.1007/978-3-319-61007-8_5

Access Statistics for this chapter

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