scientific article; zbMATH DE number 3573595

zbMath0367.90089MaRDI QIDQ4145427

Laurence A. Wolsey

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (14)

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

This page was built for publication: