The seat reservation problem
From MaRDI portal
Recommendations
Cited in
(24)- Online-bounded analysis
- Online edge coloring of paths and trees with a fixed number of colors
- Online dominating set
- Competitive risk management for online Bahncard problem
- Online multi-coloring with advice
- scientific article; zbMATH DE number 1696638 (Why is no real title available?)
- Finding an optimal seating arrangement for employees traveling to an event
- Improving the competitive ratios of the seat reservation problem
- Competitive Algorithms for Cottage Rental
- Online Multi-Coloring with Advice
- Seat reservation allowing seat changes
- The relative worst order ratio applied to seat reservation
- Algorithm Theory - SWAT 2004
- ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
- A dynamic model with resources placed on single line in revenue management
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Online bounded analysis
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Online seat reservations via offline seating arrangements.
- The off-line group seat reservation problem
- Relative Worst-Order Analysis: A Survey
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- The relative worst-order ratio applied to paging
- Competitive analysis of the online inventory problem
This page was built for publication: The seat reservation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961043)