Recent Results on Douglas–Rachford Methods for Combinatorial Optimization Problems

Francisco J. Aragón Artacho (), Jonathan M. Borwein () and Matthew K. Tam ()
Additional contact information
Francisco J. Aragón Artacho: University of Luxembourg
Jonathan M. Borwein: University of Newcastle
Matthew K. Tam: University of Newcastle

Journal of Optimization Theory and Applications, 2014, vol. 163, issue 1, No 1, 30 pages

Abstract: Abstract We discuss recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems.

Keywords: Douglas–Rachford; Projections; Reflections; Combinatorial optimization; Modelling; Feasibility; Satisfiability; Sudoku; Nonograms (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-013-0488-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:163:y:2014:i:1:d:10.1007_s10957-013-0488-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-013-0488-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().