SDP Relaxations for Some Combinatorial Optimization Problems

Renata Sotirov ()

Chapter Chapter 27 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 795-819 from Springer

Abstract: Abstract In this chapter we present recent developments on solving various combinatorial optimization problems by using semidefinite programming (SDP). We present several SDP relaxations of the quadratic assignment problem and the traveling salesman problem. Further, we show the equivalence of several known SDP relaxations of the graph equipartition problem, and present recent results on the bandwidth problem.

Keywords: Automorphism Group; Travel Salesman Problem; Travel Salesman Problem; Quadratic Assignment Problem; Symmetry Reduction (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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-1-4614-0769-0_27

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

DOI: 10.1007/978-1-4614-0769-0_27

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 ().