Amanote Research
Register
Sign In
A Heuristic and Complete Planner for the Classical Mover's Problem
doi 10.1109/robot.1995.525370
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Y.K. Hwang
P.C. Chen
Publisher
IEEE
Related search
A Heuristic for the Periodic Rural Postman Problem
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
A Heuristic for the Minimum Cost Chromatic Partition Problem
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
A Heuristic Approach for Minimum Set Cover Problem
International Journal of Advanced Research in Artificial Intelligence
A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem
Journal of Korean Institute of Intelligent Systems
A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem
Ruan Jian Xue Bao/Journal of Software
Software
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
A Randomized Population Constructive Heuristic for the Team Orienteering Problem
Journal of Computer Science
Computer Networks
Software
Artificial Intelligence
Communications
Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem
iBusiness
A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem
Production and Manufacturing Research
Industrial
Manufacturing Engineering
