A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.

Saved in:
Bibliographic Details
Title: A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.
Authors: Angelelli, Enrico1 (AUTHOR) enrico.angelelli@unibs.it, Mansini, Renata2 (AUTHOR) renata.mansini@unibs.it, Rizzi, Romeo3 (AUTHOR) romeo.rizzi@univr.it
Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p476-497. 22p.
Database: Business Source Ultimate
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: bsu
DbLabel: Business Source Ultimate
An: 191729070
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Angelelli%2C+Enrico%22">Angelelli, Enrico</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> enrico.angelelli@unibs.it</i><br /><searchLink fieldCode="AR" term="%22Mansini%2C+Renata%22">Mansini, Renata</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> renata.mansini@unibs.it</i><br /><searchLink fieldCode="AR" term="%22Rizzi%2C+Romeo%22">Rizzi, Romeo</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> romeo.rizzi@univr.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Mathematics+of+Operations+Research+%28INFORMS%29%22">Mathematics of Operations Research (INFORMS)</searchLink>. Feb2026, Vol. 51 Issue 1, p476-497. 22p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=191729070
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/moor.2022.0306
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 476
    Titles:
      – TitleFull: A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Angelelli, Enrico
      – PersonEntity:
          Name:
            NameFull: Mansini, Renata
      – PersonEntity:
          Name:
            NameFull: Rizzi, Romeo
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 0364765X
          Numbering:
            – Type: volume
              Value: 51
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Mathematics of Operations Research (INFORMS)
              Type: main
ResultId 1