A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/disopt/JepsenPSP14, #quickstatements; #temporary_batch_1731483406851
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.disopt.2014.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039810275 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58826343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation and enumeration for solving constrained shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problem with elementary shortest path based column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / 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: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut approach to the cardinality constrained circuit problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear programming relaxations for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Circuit Polytope: Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / 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 / DBLP publication ID
 
Property / DBLP publication ID: journals/disopt/JepsenPSP14 / rank
 
Normal rank

Latest revision as of 09:01, 13 November 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the capacitated profitable tour problem
scientific article

    Statements

    A branch-and-cut algorithm for the capacitated profitable tour problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    branch-and-cut algorithm
    0 references
    valid inequalities
    0 references
    profitable tour problem
    0 references
    capacitated shortest path problem
    0 references
    traveling salesman problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers