A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research - United States
doi 10.1287/opre.1040.0109
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

A Universal CAD System for Cutting Stock Problem

International Journal of Simulation Modelling
ModelingComputer Science ApplicationsSimulation
2017English

Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

A Better Heuristic for Orthogonal Graph Drawings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem

Production and Manufacturing Research
IndustrialManufacturing Engineering
2014English

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

EURO Journal on Computational Optimization
ControlSimulationManagement ScienceOptimizationModelingComputational MathematicsOperations Research
2019English

One-Dimensional Cutting Stock Problem With Cartesian Coordinate Points

International Journal of Systems Science and Applied Mathematics
2017English

A New Prioritizing-Stacking Heuristic Algorithm for the Inner-City Truck Loading Problem

International Journal of Business and Management
2013English

A Heuristic for the Periodic Rural Postman Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2005English

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

Mathematical and Computational Applications
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy