From post

Integer and Constraint Programming for Batch Annealing Process Planning.

, и . CP, том 10416 из Lecture Notes in Computer Science, стр. 431-439. Springer, (2017)

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.

 

Другие публикации лиц с тем же именем

Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues., , и . Manag. Sci., 47 (2): 264-279 (2001)Driving inventory system simulations with limited demand data: Insights from the newsvendor problem., , и . J. Simulation, 13 (2): 152-162 (2019)Combating Child Labor: Incentives and Information Disclosure in Global Supply Chains., , , и . Manuf. Serv. Oper. Manag., 21 (3): 692-711 (2019)Handbooks in Operations Research and Management Science, и . Volume 11, глава Tactical Planning Models for Supply Chain Management, стр. 423--454. Elsevier, (2003)On Bipartite and Multipartite Clique Problems., , , и . J. Algorithms, 41 (2): 388-403 (2001)A simulation-based approach to capturing autocorrelated demand parameter uncertainty in inventory management., , и . WSC, стр. 283:1-283:12. WSC, (2012)Optimal Entanglement Distillation Policies for Quantum Switches., , , , и . QCE, стр. 1198-1204. IEEE, (2023)A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations., , и . CoRR, (2018)Minimizing polynomial functions on quantum computers., , и . CoRR, (2019)Near optimality guarantees for data-driven newsvendor with temporally dependent demand: A Monte Carlo approach., , и . WSC, стр. 2643-2653. IEEE, (2013)