On the public citation graph

Solution Approaches for the Bi-Objective Skiving Stock Problem

https://doi.org/10.2139/ssrn.4133325
0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4899-3734-6openalex-extracted
Multicriteria Optimization in Engineering and in the Sciences
inferredcites →https://doi.org/10.1007/s00158-003-0368-6openalex-extracted
Survey of multi-objective optimization methods for engineering
inferredcites →https://doi.org/10.1007/s00186-016-0552-2openalex-extracted
The proper relaxation and the proper gap of the skiving stock problem
inferredcites →https://doi.org/10.1007/s00521-015-1920-1openalex-extracted
Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems
inferredcites →https://doi.org/10.1016/0196-6774(84)90004-xopenalex-extracted
On a dual version of the one-dimensional bin packing problem
inferredcites →https://doi.org/10.1016/0377-2217(80)90068-5openalex-extracted
The trim-loss and assortment problems: A survey
inferredcites →https://doi.org/10.1016/j.cie.2008.01.005openalex-extracted
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
inferredcites →https://doi.org/10.1016/j.cor.2008.07.001openalex-extracted
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
inferredcites →https://doi.org/10.1016/j.cor.2019.104770openalex-extracted
Improved flow-based formulations for the skiving stock problem
inferredcites →https://doi.org/10.1016/j.dam.2017.05.015openalex-extracted
An upper bound of Δ(E)<3∕2 for skiving stock instances of the divisible case
inferredcites →https://doi.org/10.1016/j.disopt.2018.03.001openalex-extracted
The skiving stock problem and its relation to hypergraph matchings
inferredcites →https://doi.org/10.1016/j.ejor.2003.12.021openalex-extracted
Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application
inferredcites →https://doi.org/10.1016/j.ejor.2005.12.047openalex-extracted
An improved typology of cutting and packing problems
inferredcites →https://doi.org/10.1016/j.ejor.2015.11.005openalex-extracted
Integer linear programming models for the skiving stock problem
inferredcites →https://doi.org/10.1016/j.ejor.2020.03.060openalex-extracted
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
inferredcites →https://doi.org/10.1080/02331934.2018.1494171openalex-extracted
Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
inferredcites →https://doi.org/10.1111/1475-3995.00433openalex-extracted
The skiving stock problem as a counterpart of the cutting stock problem
inferredcites →https://doi.org/10.1111/itor.12390openalex-extracted
A heuristic for the skiving and cutting stock problem in paper and plastic film industries
inferredcites →https://doi.org/10.1137/s003614459531004xopenalex-extracted
Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
inferredcites →https://doi.org/10.1155/2019/6507054openalex-extracted
The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry
inferredcites →https://doi.org/10.1287/opre.11.6.863openalex-extracted
A Linear Programming Approach to the Cutting Stock Problem—Part II
inferredcites →https://doi.org/10.1287/opre.50.6.923.348openalex-extracted
Cutting and Reuse: An Application from Automobile Component Manufacturing
inferredcites →https://doi.org/10.1287/opre.9.6.849openalex-extracted
A Linear Programming Approach to the Cutting-Stock Problem
inferredcites →https://doi.org/10.1590/0101-7438.2019.039.01.0001openalex-extracted
NEW THEORETICAL INVESTIGATIONS ON THE GAP OF THE SKIVING STOCK PROBLEM
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.