Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
Publication with shared reference
10.4018/ijaie.2019070101
Home
Publications
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
Publication with shared reference
10.4018/ijaie.2019070101
Publications with shared reference:
A Least-Loss Algorithm for a Bi-Objective One-Dimensional Cutting-Stock Problem
0
publications found
Export
Export
Analytics view
Analytics view
Scroll to top