Team Orienteering with Time-Varying Profit (Q5084650): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TOMP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NOMAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NLopt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ipopt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / 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.1287/ijoc.2020.1026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3133492686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-Free and Blackbox Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The demand weighted vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production scheduling and vehicle routing with time windows for perishable food products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase algorithm for the cyclic inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Glider routing and trajectory optimisation in disaster assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum collection problem with time-dependent rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem with variable profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / 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: An iterated local search algorithm for the team orienteering problem with variable profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 733: TOMP–Fortran modules for optimal control calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex optimization approach for solving the single-vehicle cyclic inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized orienteering problem with resource dependent rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benders decomposition algorithm: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact branch-and-price algorithm for scheduling rescue units during disaster response / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency response in natural disaster management: allocation and scheduling of rescue units / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic approach to the orienteering problem with service time dependent profits / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 29 July 2024

scientific article; zbMATH DE number 7549377
Language Label Description Also known as
English
Team Orienteering with Time-Varying Profit
scientific article; zbMATH DE number 7549377

    Statements

    Team Orienteering with Time-Varying Profit (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    team orienteering
    0 references
    routing and scheduling
    0 references
    mixed integer nonconvex programming
    0 references
    Benders branch-and-cut
    0 references
    hybrid heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references