The off-line group seat reservation problem

DOI10.1016/J.EJOR.2010.06.037MaRDI QIDQ613435zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

bin packingproduction planningberth schedulingseat reservationstorehouse planningtwo-dimensional packing problem

Mathematics Subject Classification ID

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

Recommendations

• Online seat reservations via offline seating arrangements.
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• The seat reservation problem
• Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
• Improving the competitive ratios of the seat reservation problem

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• A new constraint programming approach for the orthogonal packing problem
• A sequential algorithm for finding a maximum weightK-independent set on interval graphs
• Algorithm Theory - SWAT 2004
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• Exact solution of the two-dimensional finite bin packing problem
• Lower bounds and reduction procedures for the bin packing problem
• Network flows. Theory, algorithms, and applications.
• New classes of fast lower bounds for bin packing problems
• On the two-dimensional knapsack problem
• Online algorithms. The state of the art
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Recent advances on two-dimensional bin packing problems
• The Three-Dimensional Bin Packing Problem
• The maximum k-colorable subgraph problem for chordal graphs
• The off-line group seat reservation problem
• 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
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Two-Dimensional Finite Bin-Packing Algorithms
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(9)

• Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
• Solving a real-world train-unit assignment problem
• Online seat reservations via offline seating arrangements.
• Improving the competitive ratios of the seat reservation problem
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• Seat reservation allowing seat changes
• The off-line group seat reservation problem
• Solving a real-world train unit assignment problem

This page was built for publication: The off-line group seat reservation problem

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