The off-line group seat reservation problem

DOI10.1016/j.ejor.2010.06.037zbMath1206.90071OpenAlexW2021130407WikidataQ58826404 ScholiaQ58826404MaRDI QIDQ613435

Sumit K. Garg

Publication date: 20 December 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.037

zbMATH Keywords

production planningbin packingberth schedulingseat reservationstorehouse planningtwo-dimensional packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems, The off-line group seat reservation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The off-line group seat reservation problem
• Recent advances on two-dimensional bin packing problems
• Lower bounds and reduction procedures for the bin packing problem
• Online algorithms. The state of the art
• The maximum k-colorable subgraph problem for chordal graphs
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• On the two-dimensional knapsack problem
• A new constraint programming approach for the orthogonal packing problem
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• A sequential algorithm for finding a maximum weightK-independent set on interval graphs
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Two-Dimensional Finite Bin-Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• The Three-Dimensional Bin Packing Problem
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Algorithm Theory - SWAT 2004
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• New classes of fast lower bounds for bin packing problems