The off-line group seat reservation problem

DOI10.1016/J.EJOR.2010.06.037zbMATH Open1206.90071DBLPjournals/eor/ClausenHNP10OpenAlexW2021130407WikidataQ58826404 ScholiaQ58826404MaRDI QIDQ613435FDOQ613435

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

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

zbMATH Keywords

bin packingproduction planningberth schedulingseat reservationstorehouse planningtwo-dimensional packing problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Online algorithms. The state of the art
• The maximum k-colorable subgraph problem for chordal graphs
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• On the two-dimensional knapsack problem
• Exact solution of the two-dimensional finite bin packing problem
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
• 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
• New classes of fast lower bounds for bin packing problems
• Recent advances on two-dimensional bin packing problems
• 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
• The off-line group seat reservation problem
• A sequential algorithm for finding a maximum weightK-independent set on interval graphs
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Lower bounds and reduction procedures for the bin packing problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A new constraint programming approach for the orthogonal packing problem
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• Algorithm Theory - SWAT 2004

Cited In (5)

• Seat reservation allowing seat changes
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• The off-line group seat reservation problem
• Tight bounds on the competitive ratio on accommodating sequences for the seat reservation 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)