On the public citation graph
The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01300970openalex-snapshot
Solving binary cutting stock problems by column generation and branch-and-bound
inferredcites →https://doi.org/10.1007/bf01539705openalex-snapshot
Heuristics for the integer one-dimensional cutting stock problem: A computational study
inferredcites →https://doi.org/10.1007/s101070050105openalex-snapshot
Computational study of a column generation algorithm for bin packing and cutting stock problems
inferredcites →https://doi.org/10.1016/0305-0548(86)90077-8openalex-snapshot
Near-optimal solutions to one-dimensional cutting stock problems
inferredcites →https://doi.org/10.1016/0377-2217(90)90355-fopenalex-snapshot
Optimal solutions for the cutting stock problem
inferredcites →https://doi.org/10.1016/0925-5273(94)00045-xopenalex-snapshot
The cutting stock problem — a survey
inferredcites →https://doi.org/10.1016/j.cor.2003.11.028openalex-snapshot
A combined approach to the solution to the general one-dimensional cutting stock problem
inferredcites →https://doi.org/10.1016/j.ejor.2004.08.036openalex-snapshot
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
inferredcites →https://doi.org/10.1016/j.ejor.2005.12.047openalex-snapshot
An improved typology of cutting and packing problems
inferredcites →https://doi.org/10.1016/j.ejor.2009.10.028openalex-snapshot
A heuristic for the one-dimensional cutting stock problem with usable leftover
inferredcites →https://doi.org/10.1016/j.ejor.2015.11.005openalex-snapshot
Integer linear programming models for the skiving stock problem
inferredcites →https://doi.org/10.1038/sj/jors/0430704openalex-snapshot
Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
inferredcites →https://doi.org/10.1057/palgrave.jors.2601771openalex-snapshot
Ant colony optimization and local search for bin packing and cutting stock problems
inferredcites →https://doi.org/10.1111/1475-3995.00433openalex-snapshot
The skiving stock problem as a counterpart of the cutting stock problem
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00760.xopenalex-snapshot
An evolutionary algorithm for the one-dimensional cutting stock problem
inferredcites →https://doi.org/10.1287/mnsc.6.4.366openalex-snapshot
Mathematical Methods of Organizing and Planning Production
inferredcites →https://doi.org/10.1287/opre.29.6.1092openalex-snapshot
A New Linear Programming Approach to the Cutting Stock Problem
inferredcites →https://doi.org/10.1287/opre.9.6.849openalex-snapshot
A Linear Programming Approach to the Cutting-Stock Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4133323openalex-extracted
Solution Approaches for the Bi-Objective Skiving Stock Problem
inferred← citeshttps://doi.org/10.2139/ssrn.4133325openalex-extracted
Solution Approaches for the Bi-Objective Skiving Stock Problem
inferred← citeshttps://doi.org/10.1016/j.aime.2021.100046openalex-snapshot
An efficient mathematical model for solving one-dimensional cutting stock problem using sustainable trim
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109164openalex-snapshot
Solution approaches for the bi-objective Skiving Stock Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2025.110880openalex-snapshot
Dynamic nested column and row generation for the Skiving Stock Problem under uncertain demand
inferred← citeshttps://doi.org/10.1016/j.dam.2023.04.003openalex-snapshot
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model
inferred← citeshttps://doi.org/10.1108/apjml-12-2020-0872openalex-snapshot
Network-aware credit scoring system for telecom subscribers using machine learning and network analysis
inferred← citeshttps://doi.org/10.1108/bij-01-2020-0006openalex-snapshot
A modified boosted support vector machine to rate banks
inferred← citeshttps://doi.org/10.1109/access.2020.3009318openalex-snapshot
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1155/2023/9918022openalex-snapshot
A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process
inferred← citeshttps://doi.org/10.18421/tem131-03openalex-snapshot
Optimization of Cutting Large Amounts of Dense Material
inferred← citeshttps://doi.org/10.33751/interval.v3i1.7351openalex-snapshot
PENYELESAIAN MASALAH CUTTING STOCK DENGAN PENGELASAN MENGGUNAKAN TEKNIK COLUMN GENERATION
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.