Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the temporal dynamics of the arrivals of the itinerary requests and generates bid prices that depend on the remaining leg capacities. Our method is bas...
Saved in:
| Published in: | Operations research Vol. 57; no. 3; pp. 637 - 649 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Hanover, MD
INFORMS
01.05.2009
Institute for Operations Research and the Management Sciences |
| Subjects: | |
| ISSN: | 0030-364X, 1526-5463 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the temporal dynamics of the arrivals of the itinerary requests and generates bid prices that depend on the remaining leg capacities. Our method is based on relaxing certain constraints that link the decisions for different flight legs by associating Lagrange multipliers with them. In this case, the network revenue management problem decomposes by the flight legs, and we can concentrate on one flight leg at a time. When compared with the so-called deterministic linear program, we show that our method provides a tighter upper bound on the optimal objective value of the network revenue management problem. Computational experiments indicate that the bid prices obtained by our method perform significantly better than the ones obtained by standard benchmark methods. |
|---|---|
| AbstractList | We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the temporal dynamics of the arrivals of the itinerary requests and generates bid prices that depend on the remaining leg capacities. Our method is based on relaxing certain constraints that link the decisions for different flight legs by associating Lagrange multipliers with them. In this case, the network revenue management problem decomposes by the flight legs, and we can concentrate on one flight leg at a time. When compared with the so-called deterministic linear program, we show that our method provides a tighter upper bound on the optimal objective value of the network revenue management problem. Computational experiments indicate that the bid prices obtained by our method perform significantly better than the ones obtained by standard benchmark methods. We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the temporal dynamics of the arrivals of the itinerary requests and generates bid prices that depend on the remaining leg capacities. Our method is based on relaxing certain constraints that link the decisions for different flight legs by associating Lagrange multipliers with them. In this case, the network revenue management problem decomposes by the flight legs, and we can concentrate on one flight leg at a time. When compared with the so-called deterministic linear program, we show that our method provides a tighter upper bound on the optimal objective value of the network revenue management problem. Computational experiments indicate that the bid prices obtained by our method perform significantly better than the ones obtained by standard benchmark methods. [PUBLICATION ABSTRACT] |
| Audience | Trade |
| Author | Topaloglu, Huseyin |
| Author_xml | – sequence: 1 fullname: Topaloglu, Huseyin |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21673096$$DView record in Pascal Francis |
| BookMark | eNqFkt2L1DAUxYus4Ozqq29CEfTJjknTNs3jOn4tjB-IC76F28xtN2Ob1CR13f_edLs6CisSSKD8zu25597j5MhYg0nykJI1zWv-3I4O15TUZE1Kwe8kK1rmVVYWFTtKVoQwkrGq-HIvOfZ-TwgRZVWukubca9OlW-gcmE6DST9hDz8gaGvSYNONHcYpYLqBEZQOV9lLHNHs0IT0hd6lH51W6FNt0vcYLq37GuXf0UyYvgMDHQ4RvJ_cbaH3-ODmPUnOX7_6vHmbbT-8OducbjNVsjxkvKRCCWCVErytGRISn6ZRKs-hbXYFcCiUoHUbO2Sq4LngVDFSAqsR2pywk-TxUnd09tuEPsi9nZyJv5Q5FXlsuRARyhaogx6lNq0NDlSHBh30Mc9Wx8-nOSkIE7Sa-fUtfDw7HLS6VfDsD0EzxXjRx8vr7iL4Dibv_8af3JgGr6Bv4xSU9nJ0egB3FY1XnBFRRa5YOOWs9w5bGadxPaXoR_eSEjkvgZyXQM5LIOclONj_LftV-Z-CR4tg74N1Bx9lRQte00N-cxRu8P-v93ThL2L_l9otGc7CGfSy5JLJinH2E1SC24E |
| CODEN | OPREAI |
| CitedBy_id | crossref_primary_10_1287_opre_1110_1023 crossref_primary_10_1287_opre_2023_0546 crossref_primary_10_3390_math11030510 crossref_primary_10_1371_journal_pone_0201718 crossref_primary_10_1007_s00291_025_00821_2 crossref_primary_10_1287_ijoc_2013_0551 crossref_primary_10_1287_opre_2022_2282 crossref_primary_10_1057_s41272_020_00247_1 crossref_primary_10_1287_trsc_1090_0291 crossref_primary_10_1287_moor_1090_0411 crossref_primary_10_1287_opre_2022_2287 crossref_primary_10_1287_serv_2020_0264 crossref_primary_10_1057_jors_2011_143 crossref_primary_10_1287_opre_2015_1442 crossref_primary_10_1016_j_ejor_2023_01_006 crossref_primary_10_1007_s11771_014_2109_y crossref_primary_10_1016_j_omega_2018_06_010 crossref_primary_10_1002_nav_22039 crossref_primary_10_1057_rpm_2013_14 crossref_primary_10_1287_opre_1120_1121 crossref_primary_10_1016_j_orl_2018_04_004 crossref_primary_10_1287_trsc_2016_0708 crossref_primary_10_3390_math12243922 crossref_primary_10_1287_opre_2020_0753 crossref_primary_10_1287_opre_2021_2161 crossref_primary_10_1093_imaman_dpy015 crossref_primary_10_1287_opre_2014_1322 crossref_primary_10_1287_msom_2018_0756 crossref_primary_10_1287_msom_1110_0338 crossref_primary_10_1111_poms_12356 crossref_primary_10_1016_j_omega_2024_103213 crossref_primary_10_1016_j_cor_2024_106740 crossref_primary_10_1016_j_ejor_2011_06_033 crossref_primary_10_1080_0740817X_2010_504690 crossref_primary_10_1111_j_1937_5956_2009_01118_x crossref_primary_10_1111_poms_12239 crossref_primary_10_1287_mnsc_2019_3342 crossref_primary_10_1108_JM2_06_2020_0175 crossref_primary_10_1287_opre_2022_0668 crossref_primary_10_1057_rpm_2009_53 crossref_primary_10_1057_s41272_021_00365_4 crossref_primary_10_1080_13683500_2018_1564738 crossref_primary_10_1287_trsc_1120_0422 crossref_primary_10_1016_j_trb_2023_102874 crossref_primary_10_1007_s00500_019_03840_8 crossref_primary_10_1007_s10589_019_00068_y crossref_primary_10_1057_rpm_2012_8 crossref_primary_10_1287_ijoc_2013_0573 crossref_primary_10_1287_moor_2015_0716 crossref_primary_10_1109_TAC_2017_2731817 crossref_primary_10_1016_j_cor_2010_02_003 crossref_primary_10_1287_mnsc_2023_02588 crossref_primary_10_1016_j_tre_2016_10_003 crossref_primary_10_1016_j_ejor_2016_04_057 crossref_primary_10_1287_mnsc_2020_3735 crossref_primary_10_1016_j_cor_2024_106711 crossref_primary_10_1057_s41272_016_0062_0 crossref_primary_10_1111_poms_12983 crossref_primary_10_1287_msom_1080_0252 crossref_primary_10_2139_ssrn_4547699 crossref_primary_10_1016_j_omega_2023_102873 crossref_primary_10_1287_msom_2022_0617 crossref_primary_10_1016_j_jairtraman_2014_05_004 crossref_primary_10_1111_poms_13836 crossref_primary_10_1016_j_cor_2023_106235 crossref_primary_10_1287_ijoc_1110_0488 crossref_primary_10_1287_trsc_1110_0386 crossref_primary_10_1287_opre_2023_0453 crossref_primary_10_1016_j_ejor_2011_09_028 crossref_primary_10_1016_j_ejor_2018_05_027 crossref_primary_10_1287_trsc_2013_0469 crossref_primary_10_1287_opre_2019_1931 crossref_primary_10_1287_ijoc_2018_0816 crossref_primary_10_1287_ijoc_1090_0359 crossref_primary_10_2139_ssrn_4386239 crossref_primary_10_1287_opre_2021_2181 crossref_primary_10_1016_j_tre_2013_10_005 crossref_primary_10_1016_j_jairtraman_2013_12_016 crossref_primary_10_1287_msom_2023_1188 crossref_primary_10_1287_opre_2022_2354 crossref_primary_10_1016_j_cor_2011_11_017 crossref_primary_10_1111_poms_13742 crossref_primary_10_1287_mnsc_2022_03736 crossref_primary_10_1111_poms_12214 crossref_primary_10_1016_j_ejor_2025_05_037 crossref_primary_10_1287_opre_2024_0717 crossref_primary_10_1287_opre_2022_2427 crossref_primary_10_1287_opre_2022_0601 crossref_primary_10_1287_msom_2018_0737 crossref_primary_10_1057_rpm_2013_46 crossref_primary_10_1007_s11590_022_01945_y crossref_primary_10_1016_j_ejor_2018_01_011 crossref_primary_10_1057_rpm_2014_17 |
| Cites_doi | 10.1287/opre.1060.0368 10.1287/mnsc.44.11.1577 10.1287/trsc.33.2.207 10.1515/9780804781640 10.1287/trsc.37.3.257.16047 10.1287/opre.1070.0445 10.1007/b139000 |
| ContentType | Journal Article |
| Copyright | Copyright 2009 INFORMS 2015 INIST-CNRS COPYRIGHT 2009 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences May/Jun 2009 |
| Copyright_xml | – notice: Copyright 2009 INFORMS – notice: 2015 INIST-CNRS – notice: COPYRIGHT 2009 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences May/Jun 2009 |
| DBID | AAYXX CITATION IQODW N95 3V. 7WY 7WZ 7X7 7XB 87Z 88E 88F 8AL 8AO 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L6V M0C M0N M0S M1P M1Q M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1287/opre.1080.0597 |
| DatabaseName | CrossRef Pascal-Francis Gale Business: Insights ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Medical Database (Alumni Edition) Military Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni Edition) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Computing Database Health & Medical Collection (Alumni Edition) Medical Database Military Database Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | CrossRef ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business Applied Sciences |
| EISSN | 1526-5463 |
| EndPage | 649 |
| ExternalDocumentID | 1778628151 A204039169 21673096 10_1287_opre_1080_0597 25614781 opre.1080.0597 opres_57_3_637 |
| Genre | Research Article Feature |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| GroupedDBID | 02 08R 123 1AW 1OL 29N 2AX 3V. 4.4 7WY 7X7 85S 88E 8AL 8AO 8FE 8FG 8FI 8FJ 8FL 8G5 8V8 92 AABCJ ABBHK ABEFU ABJCF ABPPZ ABSIS ABUWG ABWPA ACDCL ACHQT ACIWK ACNCT ACUWV ACVYA ADBBV ADGDI ADNFJ AENEX AEUPB AFFNX AFKRA AJPNJ AKVCP ALMA_UNASSIGNED_HOLDINGS AQNXB AQSKT ARAPS AZQEC B-7 BBAFP BENPR BEZIV BGLVJ BPHCQ BVXVI CBXGM CCKSF CS3 CWXUR CYVLN DWQXO DZ EBA EBE EBO EBR EBS EBU ECR EHE EJD EMI EMK EPL F20 F5P FH7 FRNLG FYUFA GENNL GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUPYA GUQSH HCIFZ H~9 IAO ICJ IEA IGG IOF ITC JAV JBC JPL JSODD JST K6 K60 K6V K7- L6V LI M0C M0N M1P M1Q M2O M7S MBDVC MV1 N95 NIEAY P2P P62 PQEST PQQKQ PQUKI PRG PROAC PSQYO PTHSS QVA RNS RPU SA0 TAE TH9 TN5 U5U VQA WH7 X XFK XHC XI7 XJT XXP YNT YZZ ZCG ABDEX AETEA G8K HGD HVGLF Y99 YHZ ZY4 -DZ -~X 18M AAAZS AAWTO AAXLS AAYOK ABAWQ ABKVW ABLWH ABXSQ ABYYQ ACGFO ACHJO ACSVP ACXJH ADEPB ADMHC ADMHG ADNWM ADULT AEGXH AEMOZ AFAIT AFTQD AGKTX AHAJD AHQJS AIAGR ALIPV APTMU ASMEE BAAKF CCPQU HF~ HMCUK IPSME JAAYA JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPPEU K1G K6~ PHGZM PHGZT PQBIZ PQBZA UKHRP XOL XSW ~02 ~92 AADHG AAYXX ABDPE AFFHD CITATION PJZUB PPXIY PQGLB YYP IQODW 7XB 8FK JQ2 K9. L.- PKEHL PRINS Q9U |
| ID | FETCH-LOGICAL-c532t-7519c9a36c97f83e007f8bbcc22afbd4a7a4c918f0803c472971c305a38eaf203 |
| IEDL.DBID | M7S |
| ISICitedReferencesCount | 95 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000267403200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0030-364X |
| IngestDate | Sun Nov 02 14:14:20 EST 2025 Sat Nov 29 12:46:25 EST 2025 Sat Nov 29 11:07:39 EST 2025 Sat Nov 29 08:23:21 EST 2025 Mon Jul 21 09:15:48 EDT 2025 Sat Nov 29 01:36:27 EST 2025 Tue Nov 18 22:11:21 EST 2025 Thu Jun 19 16:02:46 EDT 2025 Tue Jan 05 23:29:22 EST 2021 Fri Jan 15 03:35:57 EST 2021 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Stochastic model Probabilistic approach Income Linear programming Network management Upper bound Lagrange multiplier Load capacity Optimal control Relaxation method Air transportation Dynamic programming Tariffication dynamic programming/optimal control: applications probability: stochastic model applications |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c532t-7519c9a36c97f83e007f8bbcc22afbd4a7a4c918f0803c472971c305a38eaf203 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 219200049 |
| PQPubID | 37962 |
| PageCount | 13 |
| ParticipantIDs | gale_infotracacademiconefile_A204039169 informs_primary_10_1287_opre_1080_0597 gale_businessinsightsgauss_A204039169 jstor_primary_25614781 gale_infotracgeneralonefile_A204039169 highwire_informs_opres_57_3_637 pascalfrancis_primary_21673096 crossref_citationtrail_10_1287_opre_1080_0597 proquest_journals_219200049 crossref_primary_10_1287_opre_1080_0597 |
| ProviderPackageCode | Y99 RPU NIEAY |
| PublicationCentury | 2000 |
| PublicationDate | 2009-05-01 |
| PublicationDateYYYYMMDD | 2009-05-01 |
| PublicationDate_xml | – month: 05 year: 2009 text: 2009-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Hanover, MD |
| PublicationPlace_xml | – name: Hanover, MD – name: Linthicum |
| PublicationTitle | Operations research |
| PublicationYear | 2009 |
| Publisher | INFORMS Institute for Operations Research and the Management Sciences |
| Publisher_xml | – name: INFORMS – name: Institute for Operations Research and the Management Sciences |
| References | B10 B11 B12 B13 B1 B2 B3 B4 B5 B6 B7 B8 B9 Wolsey L. A. (B13) 1998 Bazaraa M. S. (B3) 1993 |
| References_xml | – ident: B8 – ident: B12 – ident: B9 – ident: B11 – ident: B13 – ident: B10 – ident: B3 – ident: B2 – ident: B1 – ident: B4 – ident: B7 – ident: B5 – ident: B6 – volume-title: Integer Programming year: 1998 ident: B13 – ident: B1 doi: 10.1287/opre.1060.0368 – volume-title: Nonlinear Programming: Theory and Algorithms year: 1993 ident: B3 – ident: B9 doi: 10.1287/mnsc.44.11.1577 – ident: B10 doi: 10.1287/trsc.33.2.207 – ident: B7 doi: 10.1515/9780804781640 – ident: B5 doi: 10.1287/trsc.37.3.257.16047 – ident: B2 doi: 10.1287/opre.1070.0445 – ident: B11 doi: 10.1007/b139000 |
| SSID | ssj0009565 |
| Score | 2.2558558 |
| Snippet | We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it explicitly considers the... |
| SourceID | proquest gale pascalfrancis crossref jstor informs highwire |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 637 |
| SubjectTerms | Air transportation and traffic Analysis applications Applied sciences Approximation Bid prices Determinism Dynamic programming dynamic programming/optimal control Exact sciences and technology Ground, air and sea transportation, marine construction Lagrange multiplier Lagrange multipliers Lagrangian function Lagrangian functions Mathematical programming Matrices Operational research and scientific management Operational research. Management science Optimal solutions Portfolio management Pricing probability Revenue Revenue management stochastic model applications Stochastic models Studies Total revenue Vehicular flight |
| Title | Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management |
| URI | http://or.journal.informs.org/cgi/content/abstract/57/3/637 https://www.jstor.org/stable/25614781 https://www.proquest.com/docview/219200049 |
| Volume | 57 |
| WOSCitedRecordID | wos000267403200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: 7WY dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global (OCUL) customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M0C dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: K7- dateStart: 20000101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M7S dateStart: 20000101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M1Q dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest - Health & Medical Complete保健、医学与药学数据库 customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: 7X7 dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: P5Z dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: BENPR dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M2O dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-xDaHxwFhhogyKH_h8yNY4aZw8oa1sQmKU8jEovFiOa1eVUDvmFPHnc-c43Sq-Hng5qcnFteOfz2fn5zuAhzkaXovrZDrRY6I0NzikykJHZZxpJRQuKPyG28cTMRjko1ExDNwcF2iVjU30hno817RHvo8ji3t_9vnZt4iSRtHH1ZBBYw02KEhC7Jl77y_F3M3qBAZYlSRLRyFmI64R9inDiKfX7aF7IVbmpMYyN-GC_TEnciBdQ1kk_qRy-AptnfviFzPu56bjrf9s1U24EZxSdlCjaBuumFkLrjWc-BZsNbkfWDAFLbh-KZBhC7bDdceehjjWz25B6ekI7ERNsAEThCEj5t0PDwVWzVkolPVxvta4GIhehIS8FTucjplPSO_YdMYGNVUdH0fLvDDsgrJzG06Pjz70X0YhpUOkewmvIoEOoy5UkulCWEQHeig2L0utOVe2HKcIj1QXcW6xaxKdoucvYo0mSSW5UZZ3kx1Yn81n5g6wmGeJMF1uuoVNVUmGp1darUsd8zIztg1R06lSh3jnlHbjq6R1D4JAEghCgFQEQRueLPXP6kgff9R8RBiRIU0oCkcbKW6iFs7JA452kY4zF1ii1yP44D9rFU48YP0p6NaK5uMVzUndVb9TfNDgUgZU-so52RMykfhGsKjmxr9asePRvFTjFBRW5HEbOivwvlCIM5wPiqwNuw2YZbB4Ti6RfPevd3dhs_4eR5TRe7BenS_Mfbiqv1dTd96BNfHpM8mR6MDG4dFg-A5_vRIRytfdPsn4LUn-puPHOsph78tP-mZU-w |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lc9MwEN4pheFxoDS0Qyi0OlAeB7ex7Fj2gWFKS6edhEwPpZObkBU5kxkmKVXC40fxH9mVpbQZXqceuOQQbxRZ3m8f8upbgGc5Gt4K82Q60WOiNDcIqbLQURlnWgmFCYXbcDvril4v7_eLkyX4Ec7CUFllsInOUA8mmvbIdxFZ3MWzb84_R9Q0il6uhg4atVZ0zPevmLHZ18cH-Hi3OT98d7p_FPmmApFuJ3waCQxZdKGSTBeiwvmhj6zystSac1WVgxQnmOoizisMpRKdYuwpYo2gUEluVMVbCY57A26mSS4IVh0RXeH4zeqGCXjrSZb2PUck5iS71NHElfPtYDgjFnxg8ASBntgdq6KA1YYSSarXVBYfWVX32vjFbThfeLjyn63iA7jvg262V6NkFZbMuAG3Q81_A1ZCbwvmTV0D7l0hamzAqv_espeep_vVQyhduQXrqiEu2BBhxqiy8JtTdTadMD8o28d4RGOyEx34hsNT9nY0YCdE52TZaMx6dSk-_hw9z8ywy5KkNfhwLeuyDsvjydg8AhbzLBGmxU2rqFJVkmFtl5XWpY55mZmqCVFQIqk9nzu1FfkkKa9DpZOkdJ4AFpWuCS_m8uc1k8kfJbdJJ6Vvg4ofljaK7FDNrJV7HO0-HdcucEQnR-qK_6yVP9GB8ydSsQXJ5wuSw_pR_U5wK-BAehS4yVnZFjKRuCI4VLjwr7tYd-iZi3EivRV53ITNBThdCsQZ-rsia8JGAI_0Ft3KOXIe__XqFtw5On3fld3jXmcD7tbvHqk89gksTy9m5inc0l-mI3ux6WwHg4_XDbOfJYepKw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB6Vgio4UBqoCIXWB8rjsCTr3ezjgFBpiKgaRTkAqnoxXseOIqGk1AmPn8a_Y8Zrp414nXrgksPurOO155uHdx4AjwsUvAb9ZMro0VFaaIRUVaqoijMlc4kOhTtw-9DPB4Pi5KQcrsGPkAtDYZVBJjpBPZopOiNvIbK4s2dbxkdFDLu9V2efI2ogRR9aQzeNmkOO9fev6L3Zl0dd3Op9zntv3h2-jXyDgUh1Ej6PcjRfVCmTTJW5wbmivjRFVSnFuTTVKMXJpqqMC4NmVaJStEPzWCFAZFJoaXg7wXGvwfUcXUyKJhx2Ti_V-83q5gm4DEmWnvh6keiftKi7iQvte4GmTb6iD4NWCKWKXYoVGa82hEtS7Ka0uH2m7rvxiwpxerG3-R-v6B247Y1xdlCjZwvW9LQBGyEXoAGboecF8yKwAbcuFXBswJa_btkzX7_7-V2oXBgG68sxLt4Y4cco4vCbgwCbz5gflB2inaLQCYq6vhHxnL2ejNiQyjxZNpmyQR2ij4-jRlpodhGqdA_eX8m6bMP6dDbV94HFPEty3ea6XZpUViRwO5VRqlIxrzJtmhAFhhLK13mndiOfBPl7yICCGNAXhkUGbMLTJf1ZXeHkj5T7xJ_Ct0fFH0sHSHYsF9aKA476gNK4SxzR0RHr4j8r6TM9cP5UbGyF8skK5bjeqt8R7gVMCI8INzkrOrlIBK4IDhVu_Ostth2SlmSciuHmRdyE3RVoXRDEGerBMmvCTgCS8JLeiiWKHvz17h5sILpE_2hwvAM360-SFDX7ENbn5wv9CG6oL_OJPd91YoTBx6tG2U8nBLJP |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Using+Lagrangian+relaxation+to+compute+capacity-dependent+bid+prices+in+network+revenue+management&rft.jtitle=Operations+research&rft.au=Topaloglu%2C+Huseyin&rft.date=2009-05-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0030-364X&rft.volume=57&rft.issue=3&rft.spage=637&rft_id=info:doi/10.1287%2Fopre.1080.0597&rft.externalDBID=N95&rft.externalDocID=A204039169 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-364X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-364X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-364X&client=summon |