Author of the publication

An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy.

, , and . INFORMS J. Comput., 21 (4): 562-574 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy., , and . INFORMS J. Comput., 21 (4): 562-574 (2009)Optimal radio labellings of complete m-ary trees., , and . Discret. Appl. Math., 158 (5): 507-515 (2010)New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP., and . Math. Methods Oper. Res., 66 (1): 69-98 (2007)An Efficient Detection Mechanism Against Packet Faking Attack in Opportunistic Networks., , , and . FNSS, volume 523 of Communications in Computer and Information Science, page 84-100. Springer, (2015)Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty., , , , , and . Ann. Oper. Res., 319 (2): 1533-1564 (2022)Aggregation of Interacting Criteria in Land Combat Vehicle Selection by Using Fuzzy Measures., , and . IEEE Trans. Fuzzy Syst., 30 (9): 3979-3989 (2022)Packet Faking Attack: A Novel Attack and Detection Mechanism in OppNets., , , and . CIS, page 638-642. IEEE Computer Society, (2014)On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches.. J. Comb. Optim., 33 (1): 35-59 (2017)A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs.. Comput. Oper. Res., (2018)FlexBeamOpt: Hybrid solution methodologies for high-throughput GEO satellite beam laydown and resource allocation., , and . Int. J. Satell. Commun. Netw., 41 (6): 515-538 (November 2023)