(PDF) Solving One-Dimensional Cutting Stock Problem With

Solving One-Dimensional Cutting Stock Problem With Discrete Demands and Capacitated Planning Objective

Journal of Mathematics and Statistics - United States

doi 10.3844/jmssp.2010.79.83

Full Text

Abstract

Available in full text

Categories

Date

April 1, 2010

Authors

Unknown

Publisher

Science Publications

Related search

One-Dimensional Cutting Stock Problem With Cartesian Coordinate Points

International Journal of Systems Science and Applied Mathematics

English

One-Dimensional Cutting Stock Optimisation by Suborders

Tehnicki Vjesnik

English

Sing Generalized Fibonacci Sequences for Solving the One-Dimensional LQR Problem and Its Discrete-Time Riccati Equation

Modeling, Identification and Control

Systems Engineering

Computer Science Applications

English

Fuzzy Approach to Solve Multi-Objective Capacitated Transportation Problem

International Journal of Bioinformatics Research

English

Solving a Discrete Congested Multi-Objective Location Problem by Hybrid Simulated Annealing With Customer’s Perspective

Scientia Iranica

English

Pattern-Based Diving Heuristics for a Two-Dimensional Guillotine Cutting-Stock Problem With Leftovers

EURO Journal on Computational Optimization

Management Science

Computational Mathematics

Operations Research

English

Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional Bin Packing Problem

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences

English

Solving a Multi-Objective Mission Planning Problem for UAV Swarms With an Improved NSGA-III Algorithm

International Journal of Computational Intelligence Systems

Computational Mathematics

Computer Science

English

Practical Problem Solving With Cutting Plane Algorithms in Combinatorial Optimization

Combinatorial Optimization

English