( en | de | ru )

 

Disambiguation of "Pardalos, Panos M."

Author of the publication

copydeleteadd this publication to your clipboard
Applications of supply chain management and e-commerce research

, , , , and (Eds.) 92, New York, NY, Springer, (2005)

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.

Ara Panosyan

Ara Panosyan

Anja Panosch

Martin Panosch

Panos Meletis

 

Other publications of authors with the same name

Mathematical Programming Techniques for Sensor Networks., , , , and . Algorithms, 2 (1): 565-581 (2009)The bi-objective critical node detection problem with minimum pairwise connectivity and cost: theory and algorithms., , , and . Soft Comput., 23 (23): 12729-12744 (2019)Optimal channel assignment with list-edge coloring., , and . J. Comb. Optim., 38 (1): 197-207 (2019)Topics in parallel computing in mathematical programming., , and . Applied discrete mathematics and theoretical computer science Science Press, (1992)A bi-objective dynamic collaborative task assignment under uncertainty using modified MOEA/D with heuristic initialization., , , and . Expert Syst. Appl., (2020)Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes., , , , and . Appl. Soft Comput., (2019)Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan., , , , and . Eur. J. Oper. Res., 244 (1): 13-25 (2015)Robust aspects of solutions in deterministic multiple objective linear programming., , and . Eur. J. Oper. Res., 229 (1): 29-36 (2013)A survey of combinatorial optimization problems in multicast routing., and . Comput. Oper. Res., (2005)A branch and bound algorithm for the maximum clique problem., and . Comput. Oper. Res., 19 (5): 363-375 (1992)