Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2021.105566 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3203266107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-check approach for a wind turbine maintenance scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the time dependent team orienteering problem: application to tourist route planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-objective orienteering for personal activity scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach / rank
 
Normal rank

Latest revision as of 06:42, 28 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-check approaches for the tourist trip design problem with rich constraints
scientific article

    Statements

    Branch-and-check approaches for the tourist trip design problem with rich constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2022
    0 references
    0 references
    tourist trip design
    0 references
    branch-and-check
    0 references
    exact method
    0 references
    0 references
    0 references
    0 references