# | Document title | Authors | Year | Source | Cited by |
1 | Inverse data envelopment analysis model to preserve relative efficiency values: The case of variable returns to scale | Lertworasirikul S., Charnsethikul P., Fang S.C. | 2011 | Computers and Industrial Engineering, 61(4), pp. 1017-1023 | 103 |
2 | A study of replacement rules for a parallel fleet replacement problem based on user preference utilization pattern and alternative fuel considerations | Parthanadee P., Buddhakulsomsiri J., Charnsethikul P. | 2012 | Computers and Industrial Engineering, 63(1), pp. 46-57 | 30 |
3 | Ordering alternatives under fuzzy multiple criteria decision making via a fuzzy number dominance based ranking approach | Chu T., Charnsethikul P. | 2013 | International Journal of Fuzzy Systems, 15(3), pp. 263-273 | 9 |
4 | Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective | Wongprakornkul S., Charnsethikul P. | 2010 | Journal of Mathematics and Statistics, 6(2), pp. 79-83 | 7 |
5 | Benders decomposition with special purpose method for the sub problem in lot sizing problem under uncertain demand | Witthayapraphakorn A., Charnsethikul P. | 2019 | Operations Research Perspectives, 6, 100096 | 6 |
6 | A Column Generation Approach for Personnel Sched uling with Discrete Uncertain Requirements | Pakpoom P., Charnsethikul P. | 2019 | 2018 2nd International Conference on Informatics and Computational Sciences, ICICoS 2018, pp. 185-190, 8621664 | 6 |
7 | Comparison of exact algorithms for rectilinear distance single-source capacitated multi-facility Weber Problems | Singhtaun C., Charnsethikul P. | 2010 | Journal of Computer Science, 6(2), pp. 112-116 | 4 |
8 | The constrained minimax linear assignment problem | Charnsethikul P. | 2000 | Optimization Methods and Software, 14(1-2), pp. 37-48 | 4 |
9 | The constrained bottleneck transportation problem | Charnsethikul P., Svetasreni S. | 2007 | Journal of Mathematics and Statistics, 3(1), pp. 24-27 | 3 |
10 | Benders' decomposition based heuristics for large-scale dynamic quadratic assignment problems | Muenvanichakul S., Charnsethikul P. | 2009 | Journal of Computer Science, 5(1), pp. 64-70 | 3 |
11 | A column generations approach for the products mix based semi-infinite linear programming model | Charnsethikul P. | 2011 | International Journal of Management Science and Engineering Management, 6(2), pp. 105-108 | 3 |
12 | A Stochastic Programming Approach for Cyclic Personnel Scheduling with Double Shift Requirement | Pakpoom P., Charnsethikul P. | 2018 | WSEAS Transactions on Systems and Control, 13(1), pp. 275-284 | 3 |
13 | Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation | Witthayapraphakorn A., Jaijit S., Charnsethikul P. | 2021 | International Journal of Mathematics in Operational Research, 18(3), pp. 360-383 | 2 |
14 | A stochastic knapsack problem with continuous random capacity | Witchakul S., Ayudhaya P., Charnsethikul P. | 2008 | Journal of Mathematics and Statistics, 4(4), pp. 269-276 | 2 |
15 | A fast method for a class of one-stage bounded variables and single constrained linear programming problems | Witchakul S., Sudasna-na-Ayudthya P., Charnsethikul P. | 2007 | Journal of Interdisciplinary Mathematics, 10(2), pp. 285-303 | 2 |
16 | A graphical based method for a class of one-stage bounded variables and single constrained linear programming problems | Witchakul S., Sudasna-na-Ayudthya P., Charnsethikul P., Mathur K. | 2007 | American Journal of Applied Sciences, 4(12), pp. 1040-1044 | 2 |
17 | Efficient heuristics for single-source capacitated multifacility weber problems | Singhtaun C., Charnsethikul P. | 2008 | 38th International Conference on Computers and Industrial Engineering 2008, 1, pp. 35-40 | 2 |
18 | Solving stochastic knapsack problem with discrete random capacity | Witchakul S., Sudasna-na-Ayudthya P., Charnsethikul P. | 2007 | 37th International Conference on Computers and Industrial Engineering 2007, 1, pp. 753-762 | 1 |
19 | Two reformulations for the Dynamic Quadratic Assignment Problem | Muenvanichakul S., Charnsethikul P. | 2010 | Journal of Mathematics and Statistics, 6(4), pp. 449-453 | 1 |
20 | Parallel approaches for intervals analysis of variable statistics in large and sparse linear equations with RHS ranges | Charnsethikul P. | 2007 | American Journal of Applied Sciences, 4(5), pp. 300-306 | 1 |
21 | An adaptive special purpose algorithm for a class of two - stage single constrained linear fractional programming problem | Ketsarapong P., Charnsethikul P., Witchakul S. | 2013 | Journal of Interdisciplinary Mathematics, 16(6), pp. 439-456 | 1 |
22 | Solving large scale assignment problem using the successive complementary slackness conditions | Boonphakdee W., Charnsethikul P. | 2016 | AIP Conference Proceedings, 1775, 030008 | 1 |
23 | Cyclic personnel scheduling with uncertain demand and double shift requirements | Pakpoom P., Charnsethikul P. | 2018 | AIP Conference Proceedings, 1982, 020035 | 1 |
24 | An applied column generation approach for solving large-scale uncapacitated dynamic lot sizing problems | Boonphakdee W., Charnsethikul P. | 2018 | AIP Conference Proceedings, 2013, 020044 | 0 |
25 | A successive admissible cell method for solving large scale Linear Assignment Problem with dense cost matrix | Boonphakdee W., Charnsethikul P. | 2016 | Journal of Computer Science, 12(8), pp. 424-435 | 0 |
26 | Message from General Chairs | Okumura M., Saimek O., Charnsethikul P., Tangtermsirikul S. | 2017 | 2017 8th International Conference on Information and Communication Technology for Embedded Systems, IC-ICTES 2017 - Proceedings, 7958754 | 0 |
27 | A hybrid Dantzig-Wolfe, Benders decomposition and column generation procedure for multiple diet production planning under uncertainties | Udomsungworagul A., Charnsethikul P. | 2018 | IOP Conference Series: Materials Science and Engineering, 332(1), 012038 | 0 |
28 | Using column generation technique to estimate probability statistics in transition matrix of large scale Markov chain with least absolute deviation criteria | Lerspipatthananon W., Charnsethikul P. | 2014 | Journal of Mathematics and Statistics, 10(3), pp. 331-338 | 0 |
29 | Message from general chairs | Charnsethikul P. | 2015 | 2015 6th International Conference on Information and Communication Technology for Embedded Systems, IC-ICTES 2015, 7110804 | 0 |
30 | Column generation approach for solving uncapacitated dynamic lot-sizing problems with time-varying cost | Boonphakdee W., Charnsethikul P. | 2022 | International Journal of Mathematics in Operational Research, 23(1), pp. 55-75 | 0 |
31 | Preface | Cheung S.K.S., Paoprasert N., Li K.C., Wang F.L., Charnsethikul P., Phusavat K. | 2024 | Communications in Computer and Information Science, 1974 CCIS, pp. v-vi | 0 |
32 | LP-Based Row Generation Using Optimization-Based Sorting Method for Solving Budget Allocation with a Combinatorial Number of Constraints | Witthayapraphakorn A., Jaijit S., Charnsethikul P. | 2023 | Computation, 11(12), 242 | 0 |
33 | A general solution for a special tri-diagonal linear system | Charnsethikul P., Nuntanart C., Witthayapraphakorn A. | 2024 | Journal of Interdisciplinary Mathematics, 27(3), pp. 601-617 | 0 |
34 | A Multi-Type Ship Allocation and Routing Model for Multi-Product Oil Distribution in Indonesia with Inventory and Cost Minimization Considerations: A Mixed-Integer Linear Programming Approach | Sirait M., Sirait M., Charnsethikul P., Paoprasert N. | 2025 | Logistics, 9(1), 35 | 0 |
35 | Optimization based heuristic approaches for solving an integrated one-dimensional cutting stock-transportation problem | Wongprakornkul S., Charnsethikul P. | 2007 | Journal of Mathematics and Statistics, 3(3), pp. 142-150 | 0 |
36 | A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges | Charnsethikul P. | 2009 | International Journal of Computer Mathematics, 86(4), pp. 665-675 | 0 |
37 | A tree search approach on flowshop scheduling: Ranged processing time case | Sukcharoenpong P., Charnsethikul P., Pararach S. | 2006 | Lecture Notes in Engineering and Computer Science, pp. 665-670 | 0 |
38 | An improvement on branch and bound in flowshop scheduling: Probabilistic processing time case | Pararach S., Sukcharoenpong P., Charnsethikul P. | 2006 | Lecture Notes in Engineering and Computer Science, pp. 784-789 | 0 |