An efficient computational approach for railway booking problems (Q2455640): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DICOPT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986735445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline Seat Allocation with Multiple Nested Fare Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management: Research Overview and Prospects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Approximate Control Policies for Airline Booking with Sequential Nonmonotonic Fare Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Airline Seat Management Model for a Single Leg Route When Lower Fare Classes Book First / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Pricing in Airline Seat Management for Flights with Multiple Flight Legs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:56, 27 June 2024

scientific article
Language Label Description Also known as
English
An efficient computational approach for railway booking problems
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references