Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-013-0631-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129480990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case comparison of valid inequalities for the TSP / 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: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case / 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: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Existence of Optimal Policies in Generalized Joint Replenishment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polynomial approximations in Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPLINE APPROXIMATIONS TO VALUE FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Latest revision as of 14:16, 8 July 2024

scientific article
Language Label Description Also known as
English
Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
scientific article

    Statements

    Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (English)
    0 references
    0 references
    2 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    dynamic program
    0 references
    approximate linear program
    0 references
    integer program
    0 references
    lower bound technique
    0 references
    0 references