Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103): Difference between revisions

From MaRDI portal
Changed an 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.ejor.2018.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808122268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3074625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The third comprehensive survey on scheduling problems with setup times/costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3116854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of dynamic programming in extremal routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scheme of Independent Calculations in a Precedence Constrained Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivalued Decision Diagrams for Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load-dependent and precedence-based models for pickup and delivery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted dynamic programming: a flexible framework for solving realistic VRPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dynamic Programming Methods for Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid optimization methods for time-dependent sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling problems with past-sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic manipulation technique for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Strategies for Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based metaheuristics for the dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid control systems and the dynamic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Courier problem with the cost function depending on the list of tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant colony system for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of dynamic programming for sequencing problems with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the number of order ideals in partial orders, with some applications / rank
 
Normal rank

Latest revision as of 03:55, 17 July 2024

scientific article
Language Label Description Also known as
English
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
scientific article

    Statements

    Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (English)
    0 references
    0 references
    30 October 2018
    0 references
    0 references
    dynamic programming
    0 references
    traveling salesman problem
    0 references
    precedence constraints
    0 references
    complexity
    0 references
    time dependence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references