Solving the Double Digestion Problem as a Mixed-Integer Linear Program

Simple item page
dc.contributor.authorWu, Zhijunen_US
dc.contributor.authorZhang, Yinen_US
dc.date.accessioned2018-06-18T17:48:43Zen_US
dc.date.available2018-06-18T17:48:43Zen_US
dc.date.issued2001-08en_US
dc.date.noteAugust 2001en_US
dc.description.abstractThe double digestion problem for DNA restriction mapping is known to be NP-complete. Several approaches to the problem have been used including exhaustive search, simulated annealing, branch-and-bound. In this paper, we consider a mixed-integer linear programming formulation of the problem and show that with this formulation the problem can be solved efficiently to a fairly large size using state-of-the-art integer programming techniques. In particular, we present computational results obtained by using the CPLEX mixed-integer linear programming software on a set of randomly generated, large-scale double digestion problems.en_US
dc.format.extent16 ppen_US
dc.identifier.citationWu, Zhijun and Zhang, Yin. "Solving the Double Digestion Problem as a Mixed-Integer Linear Program." (2001) <a href="https://hdl.handle.net/1911/101974">https://hdl.handle.net/1911/101974</a>.en_US
dc.identifier.digitalTR01-12en_US
dc.identifier.urihttps://hdl.handle.net/1911/101974en_US
dc.language.isoengen_US
dc.titleSolving the Double Digestion Problem as a Mixed-Integer Linear Programen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR01-12.pdf
Size:
126.91 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports