scientific article; zbMATH DE number 3573595

zbMATH Open0367.90089MaRDI QIDQ4145427FDOQ4145427

Authors: Laurence A. Wolsey 

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cited In (14)

• Improved flow-based formulations for the skiving stock problem
• Mathematical models and decomposition methods for the multiple knapsack problem
• The cutting stock problem applied to the hardening process in an automotive spring factory
• Heuristic algorithms based on column generation for an online product shipping problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• The skiving stock problem and its relation to hypergraph matchings
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• The proper relaxation and the proper gap of the skiving stock problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145427)