Prospective network flow models and algorithms for bin packing problems

DOI10.1016/J.ENDM.2010.05.007zbMATH Open1237.90208OpenAlexW2090507854MaRDI QIDQ2883549FDOQ2883549

Authors: Alain Quilliot, Hélène Toussaint 

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.007

Recommendations

• Bin packing and related problems: general arc-flow formulation with graph compression
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Multidimensional Bin Packing Algorithms
• scientific article; zbMATH DE number 4062626

zbMATH Keywords

graphsnetwork flow theory2D-bin packing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Recent advances on two-dimensional bin packing problems
• A lower bound for the non-oriented two-dimensional bin packing problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• A new constraint programming approach for the orthogonal packing problem
• Bidimensional Packing by Bilinear Programming

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Prospective network flow models and algorithms for bin packing problems

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