The following pages link to Peerayuth Charnsethikul (Q1863885):
Displaying 14 items.
- A heuristic algorithm for the mixed Chinese postman problem (Q1863886) (← links)
- Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation (Q2664617) (← links)
- Two Reformulations for the Dynamic Quadratic Assignment Problem (Q3089048) (← links)
- A fast method for a class of one-stage bounded variables and single constrained linear programming problems (Q3511485) (← links)
- (Q3518769) (← links)
- Solving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning Objective (Q3583070) (← links)
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges (Q3630039) (← links)
- The constrained minimax linear assignment problem (Q4521378) (← links)
- 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 (Q5292944) (← links)
- (Q5305188) (← links)
- (Q5305223) (← links)
- (Q5347465) (← links)
- Solving (<i>n</i>×<i>n</i>) linear equations with parameters correlation by a first order approximation approach (Q5506037) (← links)
- SOLVING (n×n) LINEAR EQUATIONS WITH PARAMETERS COVARIANCES (Q5695035) (← links)
