Peerayuth Charnsethikul

Available identifiers

Publication	Date of Publication	Type
Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation	2021-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q5347465	2017-05-23	Paper
Two Reformulations for the Dynamic Quadratic Assignment Problem	2011-08-23	Paper
Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective	2010-08-26	Paper
The constrained bottleneck transportation problem	2010-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q5305223	2010-03-19	Paper
A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges	2009-06-02	Paper
Solving (n×n) linear equations with parameters correlation by a first order approximation approach	2009-01-28	Paper
Computational discrete time Markov chain with correlated transition probabilities	2008-08-12	Paper
A fast method for a class of one-stage bounded variables and single constrained linear programming problems	2008-07-11	Paper
List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan	2007-06-25	Paper
SOLVING (n×n) LINEAR EQUATIONS WITH PARAMETERS COVARIANCES	2005-10-11	Paper
A heuristic algorithm for the mixed Chinese postman problem	2003-03-12	Paper
The constrained minimax linear assignment problem	2002-07-22	Paper

This page was built for person: Peerayuth Charnsethikul