Amanote Research
Register
Sign In
Solving Rectangle Packing Problem Based on Heuristic Dynamic Decomposition Algorithm
DEStech Transactions on Engineering and Technology Research
doi 10.12783/dtetr/eeta2017/7728
Full Text
Open PDF
Abstract
Available in
full text
Date
April 21, 2017
Authors
Shi WANG
Publisher
DEStech Publications
Related search
An LP-based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
Zidonghua Xuebao/Acta Automatica Sinica
Control
Systems Engineering
Computer Graphics
Information Systems
Computer-Aided Design
Software
Hybrid Next-Fit Algorithm for the Two-Dimensional Rectangle Bin-Packing Problem
Computing (Vienna/New York)
Numerical Analysis
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Theoretical Computer Science
Software
A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem
Ruan Jian Xue Bao/Journal of Software
Software
An Efficient Meta-Heuristic Algorithm for Solving Capacitated Vehicle Routing Problem
International Journal of Advances in Intelligent Informatics
Computer Vision
Pattern Recognition
Human-Computer Interaction
Artificial Intelligence
A Heuristic Approach to Innovative Problem Solving
International Journal of Engineering Research and Applications
The Distributor's Three-Dimensional Pallet-Packing Problem: A Human Intelligence-Based Heuristic Approach
International Journal of Operational Research
Management Science
Operations Research
An Iterative Heuristic Algorithm for Tree Decomposition
Studies in Computational Intelligence
Artificial Intelligence
Heuristic-Based Neural Networks for Stochastic Dynamic Lot Sizing Problem
Applied Soft Computing Journal
Software
