|
 
|
[JT10] A simulated annealing for reconstructing hv-convexe binary matrices
Conférence Internationale avec comité de lecture : In 10th International Symposium on Combinatorial Optimization, March 2010, pp.447-454, Series ENDM, Hammamat, Tunisia, (DOI: 10.1016/j.endm.2010.05.057)Mots clés: Discrete tomography, convex binary matrices, integer programming, simulated annealing
Résumé:
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.
Equipe:
oc
BibTeX
| @inproceedings { | |||
| JT10, | |||
| title | = | "{A simulated annealing for reconstructing hv-convexe binary matrices}", | |
| author | = | " F. Jarray and G. Tlig ", | |
| booktitle | = | "{In 10th International Symposium on Combinatorial Optimization}", | |
| year | = | 2010, | |
| month | = | "March", | |
| series | = | "ENDM", | |
| pages | = | "447-454", | |
| address | = | "Hammamat, Tunisia", | |
| doi | = | "10.1016/j.endm.2010.05.057", | |
| } | |||
